George E. Andrews

collaborators

3 papers

math.CO2026

On Glaisher's Partition Theorem

George E. Andrews, Aritram Dhar

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m - 1$ times is equal to the number of partitions of $n$ into parts which are not divi…

math.CO2025

Extending Andrews and Newman's refinement of the crank-mex theorem

George E. Andrews, Brian Hopkins

The crank-mex theorem states that the number of integer partitions of $n$ with nonnegative crank equals the number with odd minimal excludant (mex). Andrews and M. Newman recently…

math.CO2025

On Euler's Theorem

George E. Andrews, Rahul Kumar, Ae Ja Yee

Euler's theorem asserts that $A (n) = B (n)$ where $A (n)$ is the number of partitions of $n$ into distinct parts and $B (n)$ is the number of partitions of $n$ into odd parts. In this p…