Annals of Combinatorics
Издатель: Springer Nature · ISSN 0218-0006,0219-3094 · 139 статей
- Bounded Powers of Edge Ideals: Gorenstein Polytopes
- Bijecting (n, n+1, n+2)-Core Partitions to Involutions with No Crossings or Nestings
- Lines and Opposition in Lie Incidence Geometries of Exceptional Type
- The Tropical Crossing Number of A Finite Graph
-
Transition Matrices Between Plethystic Bases of Polysymmetric Functions via Bijective Methods
Abstract Many identities involving symmetric functions can be proved through bijective manipulations of tableaux. In this paper, we prove identities and expansions involving polysymmetric functions through bijections and sign-reversing...
-
Strata of Ecological Coexistence via Grassmannians
Abstract The Lotka–Volterra system is the simplest model of the ecological interactions of n species. The sign pattern of its parameter space $$\mathbb {R}^n\times \mathbb {R}^{n\times n}$$ R n × R n × n defines the network structure of...
- The Jacobian of a Sixth-Root-of-Unity Matroid
- Higher Specht Bases and q-Series for the Cohomology Rings of Certain Hessenberg Varieties
- On the Ehrhart Theory of Generalized Symmetric Edge Polytopes
-
The Insertion Encoding of Restricted Growth Functions
Abstract We adapt the vertical and horizontal insertion encodings of Cayley permutations to enumerate restricted growth functions, which are in bijection with unordered set partitions. For both insertion encodings, we fully classify the...
-
Key and Lascoux Polynomials for Symmetric Orbit Closures
Abstract We introduce shifted analogues of key polynomials related to symplectic and orthogonal orbit closures in the complete flag variety. Our definitions are given by applying isobaric divided difference operators to the analogues of...
- Parity of the Coefficients of Certain Eta-Quotients, III: Two Special Classes
-
Bounds on the Sequence Length Sufficient to Reconstruct Binary Level-1 Phylogenetic Networks Under the CFN Model
Abstract Phylogenetic trees and networks are graphs used to model evolutionary relationships, with trees representing strictly branching histories and networks allowing for events in which lineages merge, called reticulation events....
-
Coxeter Tournaments
Abstract We describe the Coxeter permutahedra, recently studied by Ardila, Castillo, Eur and Postnikov, in terms of random Coxeter tournaments, which involve cooperative and solitaire games, as well as the usual competitive games in...
- Conformal Rigidity and Spectral Embeddings of Graphs
-
A Sharp Lower Bound for the Number of Phylogenetic Trees Displayed by a Tree-Child Network
Abstract A normal (phylogenetic) network with k reticulations displays $$2^k$$ 2 k phylogenetic trees. In this paper, we establish an analogous result for tree-child (phylogenetic) networks with no underlying 3-cycles. In particular, we...
-
The Chain Matrix of Bouquets of Geometric Lattices and Its Determinant
Abstract This work builds on Varchenko et al.’s introduction of bilinear forms for hyperplane arrangements, where the determinant of the associated matrices factorizes into simple components. While one of the determinant formulas...
- Tree-Robinson Dissimilarities
-
Cubic Factor-Invariant Graphs of Bialternating Cycle Quotient Type
Abstract In 2019, investigation of the so-called factor-invariant cubic graphs was initiated by Alspach, Khodadadpour and Kreher. For a cubic graph $$\Gamma $$ Γ and a vertex-transitive subgroup G of $$\textrm{Aut}(\Gamma )$$ Aut ( Γ )...
-
Ehrhart Functions of Weighted Lattice Points
Abstract This paper studies three different ways to assign weights to the lattice points of a convex polytope and discusses the algebraic and combinatorial properties of the resulting weighted Ehrhart functions, their generating...
-
On the Digits of Partition Functions
Abstract We study a problem of Douglass and Ono concerning the smallest integer n such that the partition function p ( n ) begins with a specified string of digits f in base b . By employing an elementary discrepancy framework, we...
-
Lattice Points and Rational q-Catalan Numbers
Abstract For each pair of coprime integers a and b , we have the rational q -Catalan number $$\operatorname {Cat}(a,b)_q=\bigl [\hspace{-1.5pt}{\begin{smallmatrix}{a+b}\\ {a}\end{smallmatrix}}\hspace{-1.0pt}\bigr ]_q/[a+b]_q.$$ Cat ( a...
-
Rectangle Partitions Generalizing Integer Partitions
Abstract In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two...
- Effect of Graph Operations on the Structure and Chromatic Number of Rotation Graphs
-
The Decompressed Tree Size of k-Ary Chains
Abstract A chain is defined as a directed acyclic graph (DAG) with one source and one sink, where the children are ordered and the spanning tree computed using a depth-first search is a path. Such DAGs emerge in the context of tree...
- On Frobenius Numbers of Shifted Power Sequences
-
The Orbit-Sum Method for Higher-Order Equations
Abstract The orbit-sum method is an algebraic version of the reflection principle that was introduced by Bousquet-Mélou and Mishna to solve functional equations that arise in the enumeration of lattice walks with small steps restricted...
-
Propagation Processes on (Hyper)graphs: Where Zero Forcing and Burning Meet
Abstract The burning and forcing processes are both instances of propagation processes on graphs that are commonly used to model real-world spreading phenomena. The contribution of this paper is twofold. We first establish a connection...
- Counting Permutations by Alternating Runs via Hetyei–Reiner Trees
- Irreducible Representations with Nonzero Degree mod p