A Bijective Proof of and Identity Extending a Classic Result of Hajos

TL;DR

This paper presents bijective proofs for two classic combinatorial identities that are traditionally proved via generating functions, addressing a long-standing challenge in combinatorics.

Contribution

It provides the first known bijective proofs for these identities, extending a classic result of Hajos and solving a problem posed since the 1930s.

Findings

Bijective proofs for two classic identities are established.

Addresses a longstanding open problem in combinatorics.

Extends a classic result of Hajos with new combinatorial insights.

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.