Bijective Proofs of Identities from Colored Binary Trees

2008/05/24 by Sherry H.F. Yan, Sherry H. F. Yan, Yan, Sherry H. F.
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #math.CO #msc:05A15 #msc:05A19 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.0805.3743

4 pages

arxiv created 2008/05/24 · arxiv updated 2009/12/01

Abstract

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

Related

• A simple bijection between binary trees and colored ternary trees
• Generalized Catalan numbers from hypergraphs
• Some identities for the Catalan and Fine numbers
• Two Quick Proofs of a Catalan Lemma Needed by Lisa Sauermann and Yuval Wigderson
• Some identities and formulas involving generalized Catalan numbers