Metraipolis › archive › dc_da95022b843f

Proof of Almkvist's conjecture on the unimodality of partition polynomials — arXiv:2609.23779

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.23779
License (as archived)
CC0-1.0
Archived
2026-10-09T21:44:54.281Z
SHA-256 of the archived text
050c41d324254ecc240522be8bb3b5d82d6b550a3d2a444036ac874e4640e692
Stable URL of this page
https://metraipolis.com/documento/dc_da95022b843f

How to cite

Proof of Almkvist's conjecture on the unimodality of partition polynomials — arXiv:2609.23779 — arXiv (en), https://arxiv.org/abs/2609.23779 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da95022b843f (Metraipolis archive dc_da95022b843f, sha256 050c41d324254ecc240522be8bb3b5d82d6b550a3d2a444036ac874e4640e692)
BibTeX
@misc{dcda95022b843f,
  title = {Proof of Almkvist's conjecture on the unimodality of partition polynomials — arXiv:2609.23779},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.23779},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da95022b843f; sha256 050c41d324254ecc240522be8bb3b5d82d6b550a3d2a444036ac874e4640e692},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23779. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For integers $r\ge2$ and $n\ge1$, let $$ F_{r,n}(q)=\prod_{k=1}^{n}\frac{1-q^{rk}}{1-q^k}. $$ The coefficient of $q^j$ in \(F_{r,n}(q)\) counts partitions of $j$ into parts at most $n$, each occurring at most $r-1$ times. Hughes proved that $F_{2,n}(q)=\prod_{k=1}^{n}(1+q^k)$ is unimodal for every $n\ge 1$. This result was reproved by Stanley using an algebraic approach and Odlyzko and Richmond using an analytic approach. Almkvist conjectured that $F_{r,n}(q)$ is unimodal in the following two cases: every even $r$ and every $n\ge 1$; every odd $r$ and every $n\ge 11$. He proved that this conjecture is true for $3\le r \le 20$ and $r=100,101$. In this paper, we completely settle the conjecture.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.23779 — 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-10-09T21:26:41.132Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).