Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem

TL;DR

This paper provides combinatorial proofs and generalizations of conjectures related to Euler's partition theorem, expanding understanding of partition identities through bijective methods.

Contribution

It introduces combinatorial proofs for three conjectures initially proved analytically, using Glaisher's bijection to clarify their combinatorial interpretations.

Findings

Combinatorial proofs of three conjectures are established.

Generalized results extend the original identities.

Enhanced understanding of partition relations and bijections.

Abstract

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck. Subsequently, using the same method as Andrews, Chern presented the analytic proof of another Beck's conjecture relating the gap-free partitions and distinct partitions with odd length. However, the combinatorial interpretations of these conjectures are still unclear and required. In this paper, motivated by Glaisher's bijection, we give the combinatorial proofs of these three conjectures directly or by proving more generalized results.