Bijective proofs of identities from colored binary trees
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

This note provides bijective proofs of two combinatorial identities involving generalized Catalan number $C_{m,5}(n)={m\over 5n+m}{5n+m\choose n}$ recently proposed by Sun.
DOI : 10.37236/895
Classification : 05A19, 05A15
@article{10_37236_895,
     author = {Sherry H.F. Yan},
     title = {Bijective proofs of identities from colored binary trees},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/895},
     zbl = {1160.05309},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/895/}
}
TY  - JOUR
AU  - Sherry H.F. Yan
TI  - Bijective proofs of identities from colored binary trees
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/895/
DO  - 10.37236/895
ID  - 10_37236_895
ER  - 
%0 Journal Article
%A Sherry H.F. Yan
%T Bijective proofs of identities from colored binary trees
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/895/
%R 10.37236/895
%F 10_37236_895
Sherry H.F. Yan. Bijective proofs of identities from colored binary trees. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/895

Cité par Sources :