A short conceptual proof of Narayana's path-counting formula
The electronic journal of combinatorics, Tome 23 (2016) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We deduce Narayana's formula for the number of lattice paths that fit in a Young diagram as a direct consequence of the Gessel-Viennot theorem on non-intersecting lattice paths.
DOI : 10.37236/6131
Classification : 05C30, 05C38, 05E10
Mots-clés : lattice paths, Young diagram, Narayana's path-counting formula

Mihai Ciucu  1

1 Indiana University
@article{10_37236_6131,
     author = {Mihai Ciucu},
     title = {A short conceptual proof of {Narayana's} path-counting formula},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {4},
     doi = {10.37236/6131},
     zbl = {1351.05117},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6131/}
}
TY  - JOUR
AU  - Mihai Ciucu
TI  - A short conceptual proof of Narayana's path-counting formula
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6131/
DO  - 10.37236/6131
ID  - 10_37236_6131
ER  - 
%0 Journal Article
%A Mihai Ciucu
%T A short conceptual proof of Narayana's path-counting formula
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/6131/
%R 10.37236/6131
%F 10_37236_6131
Mihai Ciucu. A short conceptual proof of Narayana's path-counting formula. The electronic journal of combinatorics, Tome 23 (2016) no. 4. doi: 10.37236/6131

Cité par Sources :