论文信息 - Bijective Proofs of Partition Identities of MacMahon, Andrews, and Subbarao

Bijective Proofs of Partition Identities of MacMahon, Andrews, and Subbarao

We revisit a classic partition theorem due to MacMahon that relates partitions with all parts repeated at least once and partitions with parts congruent to $2,3,4,6 \pmod 6$, together with a generalization by Andrews and two others by Subbarao. Then we develop a unified bijective proof for all four theorems involved, and obtain a natural further generalization as a result.

Shishuo Fu | James A. Sellers

[1] S. Finch. Integer partitions , 2021 .

[2] George E. Andrews. A generalization of a partition theorem of MacMahon , 1967 .

[3] Alexander E. Holroyd. Partition identities and the coin exchange problem , 2008, J. Comb. Theory, Ser. A.

[4] M. V. Subbarao. On a partition theorem of MacMahon-Andrews , 1971 .

[5] J. Shaw. Combinatory Analysis , 1917, Nature.

[6] Bruce C. Berndt,et al. Number theory in the spirit of Ramanujan , 2006 .

[7] Ae Ja Yee. MacMahon's partition identity and the coin exchange problem , 2009, J. Comb. Theory, Ser. A.

[8] George E. Andrews,et al. Integrals, partitions and MacMahon's Theorem , 2007, J. Comb. Theory, Ser. A.