A note on Andrews-MacMahon theorem
Abstract
For a positive integer r, George Andrews proved that the set of partitions of n in which odd multiplicities are at least 2r + 1 is equinumerous with the set of partitions of n in which odd parts are congruent to 2r + 1 modulo 4r + 2. This was given as an extension of MacMahon's theorem (r = 1). Andrews, Ericksson, Petrov and Romik gave a bijective proof of MacMahon's theorem. Despite several bijections being given, until recently, none of them was in the spirit of Andrews-Ericksson-Petrov-Romik bijection. Andrews' theorem has also been extended recently. Our goal is to give a generalized bijective mapping of this further extension in the spirit of Andrews-Ericksson-Petrov-Romik bijection.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.