Eulerian-Catalan Numbers

  • Hoda Bidkhori
  • Seth Sullivant

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.

Published
2011-09-20
How to Cite
Bidkhori, H., & Sullivant, S. (2011). Eulerian-Catalan Numbers. The Electronic Journal of Combinatorics, 18(1), P187. https://doi.org/10.37236/674
Article Number
P187