A Bijective Proof of and Identity Extending a Classic Result of Hajos
classification
🧮 math.CO
keywords
bijectivefirstidentityclassicproofprovecombinatoriallydifficult
read the original abstract
We provide bijective proofs of two classic identities that are very simple to prove using generating functions, but surprisingly difficult to prove combinatorially. The problem of finding a bijective proof for the first identity was first raised in the 1930s. The second, more involved identity takes the first one a step further.
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.