Papers
Topics
Authors
Recent
Search
2000 character limit reached

A note on Andrews-MacMahon theorem

Published 28 Dec 2022 in math.CO | (2212.13926v1)

Abstract: For a positive integer rr, George Andrews proved that the set of partitions of nn in which odd multiplicities are at least $2r + 1$ is equinumerous with the set of partitions of nn in which odd parts are congruent to $2r + 1$ modulo $4r + 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.

Authors (1)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.