A note on Andrews-MacMahon theorem
Combinatorics
2022-12-29 v1
Abstract
For a positive integer , George Andrews proved that the set of partitions of in which odd multiplicities are at least is equinumerous with the set of partitions of in which odd parts are congruent to modulo . This was given as an extension of MacMahon's theorem (). 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.
Cite
@article{arxiv.2212.13926,
title = {A note on Andrews-MacMahon theorem},
author = {Darlison Nyirenda},
journal= {arXiv preprint arXiv:2212.13926},
year = {2022}
}