Eulerian-Catalan Numbers
Combinatorics
2011-01-07 v1
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.
Cite
@article{arxiv.1101.1108,
title = {Eulerian-Catalan Numbers},
author = {Hoda Bidkhori and Seth Sullivant},
journal= {arXiv preprint arXiv:1101.1108},
year = {2011}
}
Comments
8 pages