Bijective Proofs of Identities from Colored Binary Trees
Abstract
This note provide bijective proofs of two combinatorial identities involving generalized Catalan number Cm,5(n)=m 5n+m5n+m n recently proposed by Sun.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.