A Refinement of the Crank-Mex Theorem

2025/08/24 by Andrews, George E, Newman, Moshe · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2508.17491

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..

Citations

• A bijective proof of a generalization of the non-negative crank--odd mex identity
• Partitions and the Minimal Excludant

Cited by

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

Related

• Extending Andrews and Newman's refinement of the crank-mex theorem
• A bijective proof of a generalization of the non-negative crank--odd mex identity
• Partitions weighted by the parity of the crank
• Number of partitions of n into parts not divisible by m
• A conjecture about partitions