Bijective Proofs of Identities from Colored Binary Trees
classification
🧮 math.CO
keywords
bijectiveidentitiesproofsbinarycatalanchoosecoloredcombinatorial
read the original abstract
This 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.