Bijective Proofs of Identities from Colored Binary Trees

Simple item page
dc.creatorYan, Sherry H. F.
dc.date2008-05-24
dc.date.accessioned2026-07-07T09:40:48Z
dc.date.available2026-07-07T09:40:48Z
dc.descriptionThis note provide 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.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/0805.3743
dc.identifierhttp://arxiv.org/abs/0805.3743
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/161607
dc.subjectCombinatorics
dc.subject05A15, 05A19
dc.titleBijective Proofs of Identities from Colored Binary Trees
dc.typetext

Files

Collections

arXiv