Eulerian-Catalan Numbers

2011/01/05 by Hoda Bidkhori, Bidkhori, Hoda, Seth Sullivant +1
Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #Mathematics and Applications

paper · pdf · doi:10.48550/arxiv.1101.1108

openalex publication_date 2011/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Lattice Path Matroid Polytopes

Related

• Major Index on Catalan Combinatorics
• A derivation of the Catalan numbers from a bijection between permutations and labeled trees
• Modular Catalan Numbers
• A Bijection Between Weighted Dyck Paths and 1234-avoiding Up-Down Permutations
• More bijective Catalan combinatorics on permutations and on signed\n permutations