Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations
From MaRDI portal
Publication:604652
DOI10.1007/s00373-010-0895-zzbMath1226.05022arXiv0806.0973OpenAlexW2081130995WikidataQ60691932 ScholiaQ60691932MaRDI QIDQ604652
Publication date: 12 November 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.0973
Bruhat orderhyperoctahedral groupcentral binomial coefficientcoloured noncrossing partitionGrand-Dyck path
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of representation theory (05E10) Structure theory of lattices (06B05)
Related Items
On divisibility of convolutions of central binomial coefficients ⋮ New interpretations for noncrossing partitions of classical types ⋮ On \(q\)-series and split lattice paths
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Riordan group
- Stirling numbers interpolation using permutations with forbidden subsequences
- A bijection on Dyck paths and its consequences
- Non-crossing partitions for classical reflection groups
- Unimodality and Young's lattice
- Bell numbers, their relatives, and algebraic differential equations
- Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
- Lattices of lattice paths
- Enumerating permutations avoiding three Babson-Steingrímsson patterns
- Combinatorics of Coxeter Groups
- A Note on the Compositions of an Integer
- THE HOPF ALGEBRAS OF SYMMETRIC FUNCTIONS AND QUASI-SYMMETRIC FUNCTIONS IN NON-COMMUTATIVE VARIABLES ARE FREE AND CO-FREE
- ECO:a methodology for the enumeration of combinatorial objects
- An area-to-inv bijection between Dyck paths and 312-avoiding permutations
- Permutations with restricted patterns and Dyck paths
- Approximating algebraic functions by means of rational ones
