Journal ArticleOPEN ACCESS

Eulerian-Catalan numbers

Electronic Journal of Combinatorics (2011) 18(1) 1-10
DOI: 10.37236/674
6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Bidkhori, H., & Sullivant, S. (2011). Eulerian-Catalan numbers. Electronic Journal of Combinatorics, 18(1), 1–10. https://doi.org/10.37236/674

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free