Name
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. |
Year | Venue | Keywords |
|---|---|---|
2011 | Electr. J. Comb. | dyck permutation,dyck path,ballot sequence.,eulerian-catalan number,catalan number |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Catalan number,Permutation,Eulerian path,Mathematical proof,Combinatorial proof,Polytope,Schröder–Hipparchus number,Mathematics | Journal | 18 |
Issue | Citations | PageRank |
1 | 0 | 0.34 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hoda Bidkhori | 1 | 14 | 3.19 |
| Seth Sullivant | 2 | 93 | 19.17 |