Extending Andrews and Newman's refinement of the crank-mex theorem
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914169947684864 |
|---|---|
| author | Andrews, George E. Hopkins, Brian |
| author_facet | Andrews, George E. Hopkins, Brian |
| contents | 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 refined that result in terms of the number of parts greater than one. Here, we establish and expand a complementary result connecting the partitions with even mex, having fixed points, with negative crank, and with positive crank, all refined in terms of number of parts greater than one. We provide both analytic and combinatorial proofs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_19698 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Extending Andrews and Newman's refinement of the crank-mex theorem Andrews, George E. Hopkins, Brian Combinatorics Number Theory 11P82, 05A17 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 refined that result in terms of the number of parts greater than one. Here, we establish and expand a complementary result connecting the partitions with even mex, having fixed points, with negative crank, and with positive crank, all refined in terms of number of parts greater than one. We provide both analytic and combinatorial proofs. |
| title | Extending Andrews and Newman's refinement of the crank-mex theorem |
| topic | Combinatorics Number Theory 11P82, 05A17 |
| url | https://arxiv.org/abs/2511.19698 |