Abstract: We show that the Eulerian-Catalan numbers enumerate Dyck permutations. We provide two proofs for this fact, the first using the geometry of alcoved polytopes and the second a direct combinatorial proof via an Eulerian-Catalan analogue of the Chung-Feller theorem.
Recommendations
Cited in
(8)- Euler's enumerations
- Caylerian polynomials
- Eulerian Numbers
- A decomposition of ballot permutations, pattern avoidance and Gessel walks
- The peak and descent statistics over ballot permutations
- Refined Eulerian numbers and ballot permutations
- A Toeplitz property of ballot permutations and odd order permutations
- Ballot permutations and odd order permutations
This page was built for publication: Eulerian-Catalan numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640447)