Bijective proofs of identities from colored binary trees
The electronic journal of combinatorics, Tome 15 (2008)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv EuDML
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.
Sherry H.F. Yan. Bijective proofs of identities from colored binary trees. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/895
@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/}
}
Cité par Sources :