A Refinement of the Crank-Mex Theorem
Combinatorics
2025-08-26 v1
Abstract
It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..
Cite
@article{arxiv.2508.17491,
title = {A Refinement of the Crank-Mex Theorem},
author = {George E Andrews and Moshe Newman},
journal= {arXiv preprint arXiv:2508.17491},
year = {2025}
}