Eulerian-Catalan numbers
From MaRDI portal
Publication:640447
zbMATH Open1236.05010arXiv1101.1108MaRDI QIDQ640447FDOQ640447
Publication date: 18 October 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1101.1108
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10)
Cited In (7)
- Euler's enumerations
- 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
Uses Software
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)