Several authors have recently considered the smallest positive part missing from an integer partition, known as the minimum excludant or mex. In this work, we revisit and extend connections between Dyson’s crank statistic, the mex, and Frobe-nius symbols, with a focus on combinatorial proof techniques. One highlight is a generating function expression for the number of partitions with a bounded crank that does not include an alternating sum. This leads to a combinatorial interpreta-tion involving types of Durfee rectangles. A recurring combinatorial technique uses sign reversing involutions on certain triples of partitions to establish a result of Fine and other identities.
Bibliographical noteFunding Information:
We appreciate the helpful comments of two anonymous referees. The third named author was partially supported by a grant (#633963) from the Simons Foundation.
© The authors.