English

Bijective Proofs of Identities from Colored Binary Trees

Combinatorics 2008-05-27 v1

Abstract

This note provide bijective proofs of two combinatorial identities involving generalized Catalan number Cm,5(n)=m5n+m(5n+mn)C_{m,5}(n)={m\over 5n+m}{5n+m\choose n} recently proposed by Sun.

Keywords

Cite

@article{arxiv.0805.3743,
  title  = {Bijective Proofs of Identities from Colored Binary Trees},
  author = {Sherry H. F. Yan},
  journal= {arXiv preprint arXiv:0805.3743},
  year   = {2008}
}

Comments

4 pages

R2 v1 2026-06-21T10:43:46.624Z