Metraipolis › archive › dc_0c445247a259
The parity of the number of missing integers in partitions — arXiv:2611.07908
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.07908
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:52:49.695Z
- SHA-256 of the archived text
71d9eedc835eb9452403ecbc84b234b7b5256feb758b933066da2398f7acacac- Stable URL of this page
https://metraipolis.com/documento/dc_0c445247a259
How to cite
The parity of the number of missing integers in partitions — arXiv:2611.07908 — arXiv (en), https://arxiv.org/abs/2611.07908 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0c445247a259 (Metraipolis archive dc_0c445247a259, sha256 71d9eedc835eb9452403ecbc84b234b7b5256feb758b933066da2398f7acacac)
BibTeX
@misc{dc0c445247a259,
title = {The parity of the number of missing integers in partitions — arXiv:2611.07908},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.07908},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0c445247a259; sha256 71d9eedc835eb9452403ecbc84b234b7b5256feb758b933066da2398f7acacac},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07908. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Missing integers in partitions have been studied by many authors. A missing integer of a partition is a positive integer smaller than its largest part that does not occur as a part. We investigate parity biases for the number of missing integers in partitions and overpartitions. For every integer $c\ge2$, we prove that the coefficients $a_c(n)$ of $(-cq;q)_\infty/(-q;q)_\infty$ are eventually strictly positive and provide an effectively computable threshold. The proof uses the circle method, combining a saddle-point analysis on the major arc with explicit uniform estimates on the minor arcs. Specializing to $c=2$ and $c=3$, and verifying the remaining finite cases, we show that partitions and overpartitions of $n$ with an even number of missing integers outnumber those with an odd number for $n>34$ and $n>27$, respectively. We further prove that, for $n>10$, the difference between the numbers of ordinary partitions with an even and an odd number of missing integers is smaller than the number of partitions of $n$ into distinct parts. These results confirm three conjectures of Bhoria, Eyyunni and Santra. We also give a combinatorial interpretation of $a_c(n)$ for every integer $c\ge4$ in terms of colored partitions, generalizing the partition and overpartition interpretations of Bhoria, Eyyunni and Santra for $c=2$ and $c=3$, respectively. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT). Pagina del lavoro: https://arxiv.org/abs/2611.07908 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-06T14:24:27.845Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).