Lattice paths and generalized cluster complexes
From MaRDI portal
Publication:958726
DOI10.1016/j.jcta.2007.12.011zbMath1158.05005OpenAlexW2040554575MaRDI QIDQ958726
Publication date: 8 December 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2007.12.011
Exact enumeration problems, generating functions (05A15) Structure and representation theory of distributive lattices (06D05)
Related Items
Enumeration of Fuss-Schröder paths, On Delannoy paths without peaks and valleys, The \(m\)-Schröder paths and \(m\)-Schröder numbers, Lagrange inversion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Staircase tilings and \(k\)-Catalan structures
- Some remarks on Catalan families
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Dyck path enumeration
- A type-B associahedron.
- \(Y\)-systems and generalized associahedra
- Enumerative properties of generalized associahedra
- Polygon dissections and some generalizations of cluster complexes
- Why Delannoy numbers?
- The generalized Schröder theory
- The dual braid monoid
- A partial order on the symmetric group and new \(K(\pi,1)\)'s for the braid groups