Annals of Combinatorics
Publisher: Springer Nature · ISSN 0218-0006,0219-3094 · 139 articles
-
Global Least Common Ancestor (LCA) Networks
Abstract Directed acyclic graphs (DAGs) are fundamental structures used across many scientific fields. A key concept in DAGs is the least common ancestor (LCA), which plays a crucial role in understanding hierarchical relationships....
- Double Shortcuts of Standard Hypercube Decompositions
- Laguerre Determinants
- Dominique Foata (1934–2026)
- A Bijection Between 321- and 213-Avoiding Permutations Preserving t-Stack-Sortability
-
Revealing the Building Blocks of Tree Balance: Fundamental Units of the Sackin and Colless Indices
Abstract (Im)balance indices can be used to quantify the (im)balance of trees by assigning numerical scores to them. An easy way to generate a new index is to construct a compound index, e.g., a linear combination of established...
- Largest Laplacian Eigenvalues of Simplicial Complexes: Local Bounds and Equality Criteria via Homology
- Subdivisions of Lower Eulerian Posets
-
Colorings of Unrooted Tree-Based Networks and Related Graphs
Abstract In mathematical phylogenetics, evolutionary relationships are often represented by trees and networks. The latter are typically used whenever the relationships cannot be adequately described by a tree, which happens when...
- Tensor Invariants for Classical Groups Revisited
-
Tensor Products of Multimatroids and a Brylawski-Type Formula for the Transition Polynomial
Abstract Brylawski’s tensor product formula expresses the Tutte polynomial of the tensor product of two graphs or matroids in terms of Tutte polynomials arising from the tensor factors. Analogous tensor product formulas are known for...
-
Strengthening the Balanced Set Condition for the Distance-Regular Graph of the Bilinear Forms
Abstract We consider a distance-regular graph $$\Gamma =(X, \mathcal {R})$$ Γ = ( X , R ) called the bilinear forms graph $$H_q(D,N-D)$$ H q ( D , N - D ) ; we assume $$N>2D\ge 6$$ N > 2 D ≥ 6 and $$q \not =2$$ q ≠ 2 . We show that...
-
Finite Kleshchev Bipartitions and q-Trinomial Coefficients
Abstract The Kleshchev multipartitions arise from the representation theory of the Ariki–Koike algebras. In previous work, Li, Stanton, Xue, Yee, and the author considered a refined enumeration for the 2-dimensional case, namely, the...
-
Extendability of the $$B_2$$-Arrangement
Abstract Let $$({\mathscr {A}},m)$$ ( A , m ) be a free multiarrangement, and let $${\mathscr {E}}$$ E be an extension of $$({\mathscr {A}},m)$$ ( A , m ) . It is well known that if $${\mathscr {A}}$$ A is the Coxeter arrangement of...
- Inverse Kazhdan–Lusztig Polynomials of Fan Matroids
- Decomposition Theorems for Unmatchable Pairs in Groups and Field Extensions
-
Log-Concavity and the Multiplicative Properties of Restricted Partition Functions
Abstract The partition function p ( n ) and many of its related restricted partition functions have recently shown independently to satisfy log-concavity: $$p(n)^2 \ge p(n-1)p(n+1)$$ p ( n ) 2 ≥ p ( n - 1 ) p ( n + 1 ) for $$n\ge 26$$ n...
- The Cactus Group Property for Ordinal Sums of Disjoint Unions of Chains
- A New Proof of the Semistandard Key Tableau Formula of Key Polynomials
- Algorithms for the Generation of Snarks
-
e-Positive Partitions for Chromatic Symmetric Functions
Abstract We show that the partitions that always appear with nonnegative e -coefficients in chromatic symmetric functions of finite graphs are precisely the hook partitions.
-
A Complete Characterization of Pairs of Binary Phylogenetic Trees with Identical $$A_k$$-Alignments
Abstract Phylogenetic trees play a key role in the reconstruction of evolutionary relationships. Typically, they are derived from aligned sequence data (like DNA, RNA, or proteins) using optimization criteria like, e.g., maximum...
- Rainbow Directed Cycles of Order 4 in the Complete Biorientation of $$K_n$$
- Combinatorial Proofs of Petrie Pieri Rule and Plethystic Pieri Rule
-
Mutation Cycles from Reddening Sequences
Abstract Given two quivers, each with a reddening sequence, we show how to construct a plethora of mutation cycles. We give several examples, including a generalization of the construction of long mutation cycles in earlier work by the...
- Levelable Graphs
- Regular Maps of Given Hyperbolic Type with No Non-trivial Exponents
- The Ungar Games on Graded Posets
- Realizations and Uniqueness of Cut Complexes of Graphs
- Maximum k-Forests Are Tight