Annals of Combinatorics
Издатель: Springer Nature · ISSN 0218-0006,0219-3094 · 139 статей
- All Cycle-Chords are e-Positive
- Stirling Numbers for Complex Reflection Groups
- Mixing on Generalized Associahedra
-
Crystal Chute Moves on Pipe Dreams
Abstract Schubert polynomials represent a basis for the cohomology of the complete flag variety and thus play a central role in geometry and combinatorics. In this context, Schubert polynomials are generating functions over various...
- Minimum Quantum Degrees with Maya Diagrams
- A Combinatorial Interpretation of the Series for Rogers–Ramanujan–Gordon Identities when $$k=3$$
- Arithmetic Relations Modulo 3, 27 and 81 for Overpartitions
- Bubble Lattices II: Combinatorics
- The Distribution of the Length of the Longest Path in Random Acyclic Orientations of a Complete Bipartite Graph
- Multiple Series Identities of the Rogers–Ramanujan Type for Overpartition Pairs
- The Connectivity of Friends-and-Strangers Graphs on Complete Multipartite Graphs
- Completing the Asymptotic Classification of Mostly Symmetric Short Step Walks in an Orthant
- From Hodge Theory for Tame Functions to Ehrhart Theory for Polytopes
-
Local Limit Theorems for Hook Lengths in Partitions
Abstract Partition hook lengths have wide-ranging applications in combinatorics, number theory, physics, and representation theory. We study two infinite families of random variables associated with t -hooks. For fixed $$t\ge 1,$$ t ≥ 1...
- Special Functions for Hyperoctahedral Groups Using Bosonic Lattice Models
- On Partitions with Bounded Largest Part and Fixed Integral GBG-rank Modulo Primes
-
Words Avoiding Tangrams
Abstract A tangram is a word in which every letter occurs an even number of times. Such word can be cut into parts that can be arranged into two identical words. The minimum number of cuts needed is called the cut number of a tangram....
-
Planar Binary Trees, Noncrossing Partitions and the Operator-Valued S-Transform
Abstract We revisit the twisted multiplicativity property of Voiculescu’s S-transform in the operator-valued setting, using a specific bijection between planar binary trees and noncrossing partitions.
- Two-Face Complete Regular Dessins