Combinatorial perspectives on the crank and mex partition statistics
Summary: 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 Frobenius 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 interpretation 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.
- A new refinement of Fine's partition theorem
- A note on the Jacobi theta formula
- A Stanley-Elder theorem on cranks and Frobenius symbols
- An Enumerative Proof of An Identity of Jacobi
- Analysis of some new partition statistics
- Combinatorial proof of the minimal excludant theorem
- Concave compositions
- Dyson's crank and the mex of integer partitions
- Dyson’s crank of a partition
- Generating functions for certain weighted cranks
- scientific article; zbMATH DE number 193367 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 2117212 (Why is no real title available?)
- New Combinatorial Interpretations of Ramanujan's Partition Congruences Mod 5,7 and 11
- On the number of equivalence classes arising from partition involutions. II
- Parity Considerations for Mex-Related Partition Functions of Andrews and Newman
- Partition recurrences
- Partitions and the maximal excludant
- Partitions and the minimal excludant
- The minimal excludant and colored partitions
- The minimal excludant in integer partitions
- Turning the Partition Crank
- Diagonal hooks and a Schmidt-type partition identity
- Dyson's crank and the mex of integer partitions
- Partition identities related to the minimal excludant
- The minimal excludant and Schmidt's partition theorem
- A new generalization of the minimal excludant arising from an analogue of Franklin's identity
- A bijective proof of a generalization of the non-negative crank-odd mex identity
- Parity Considerations for Mex-Related Partition Functions of Andrews and Newman
- More on Schmidt's partition theorem
- Two partition inequalities related to the minimal excludant
- A refinement of a result of Andrews and Newman on the sum of minimal excludants
- On Blecher and Knopfmacher's fixed points for integer partitions
- Combinatorial Perspectives on the Crank and Mex Partition Statistics
- Arithmetic properties and asymptotic formulae for \(\sigma_o \mathrm{mex}(n)\) and \(\sigma_e \mathrm{mex}(n)\)
- Some conjectures of Ballantine and Merca on truncated sums and the minimal excludant in congruences classes
- The minimal excludant of bipartitions
- A refinement of the Crank-Mex theorem
- New combinatorial interpretations of two truncated sums of theta series
- Combinatorial interpretations of truncated series from the Jacobi triple product identity
- Proof of a conjecture on congruences of the sum of minimal excludants
- Second class particle behaviour in blocking ASEP
- New congruences on the sum of odd and even minimal excludants
- Extending Andrews and Newman's refinement of the Crank-Mex theorem
- A companion to Andrews and Hopkins' extension of the Crank-Mex theorem
- Generalizations of the Crank-Mex theorem and the Frobenius-Mex theorem
This page was built for publication: Combinatorial perspectives on the crank and mex partition statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138567)
