English

A note on Andrews-MacMahon theorem

Combinatorics 2022-12-29 v1

Abstract

For a positive integer rr, George Andrews proved that the set of partitions of nn in which odd multiplicities are at least 2r+12r + 1 is equinumerous with the set of partitions of nn in which odd parts are congruent to 2r+12r + 1 modulo 4r+24r + 2. This was given as an extension of MacMahon's theorem (r=1r = 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.

Keywords

Cite

@article{arxiv.2212.13926,
  title  = {A note on Andrews-MacMahon theorem},
  author = {Darlison Nyirenda},
  journal= {arXiv preprint arXiv:2212.13926},
  year   = {2022}
}
R2 v1 2026-06-28T07:54:57.859Z