Metraipolis › archive › dc_a7a09e462c2e

Graph binomial coefficients and a positivity conjecture of Guo and Krattenthaler — arXiv:2610.19249

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.19249
License (as archived)
CC0-1.0
Archived
2026-10-15T21:52:38.158Z
SHA-256 of the archived text
eb65df4c83b75281c22839ad81d3bd62beb954018e5665908c02dde3deaf9bce
Stable URL of this page
https://metraipolis.com/documento/dc_a7a09e462c2e

How to cite

Graph binomial coefficients and a positivity conjecture of Guo and Krattenthaler — arXiv:2610.19249 — arXiv (en), https://arxiv.org/abs/2610.19249 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a7a09e462c2e (Metraipolis archive dc_a7a09e462c2e, sha256 eb65df4c83b75281c22839ad81d3bd62beb954018e5665908c02dde3deaf9bce)
BibTeX
@misc{dca7a09e462c2e,
  title = {Graph binomial coefficients and a positivity conjecture of Guo and Krattenthaler — arXiv:2610.19249},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.19249},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a7a09e462c2e; sha256 eb65df4c83b75281c22839ad81d3bd62beb954018e5665908c02dde3deaf9bce},
  year = {2026}
}

Archived text

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

We investigate Conjecture 7.4 of Guo and Krattenthaler \cite{GK}, which predicts that for every positive integer $n$, the polynomial \[ P_n(q) = \frac{(1-q)^2}{(1-q^{10n-1})(1-q^{15n-1})}\qbin{30n}{5n} \] has non-negative coefficients, except for $q^1$ and $q^{125n^2-25n+3}$, which equal $-1$. We study this problem through three main perspectives: First, by linking the boundary coefficients to the second differences of the partition function, we settle the first and last $25n+1$ coefficients via a novel partition injection. Second, by introducing a ``defect'' generalization of Andrews' classical lemma, we reduce the conjecture to an almost-unimodality property and employ a uniform saddle-point analysis to prove it analytically for all large $n \ge 2\cdot 10^{29}$. Finally, we connect these quotients to graph binomial coefficients, providing a natural orbit-counting interpretation via Burnside's lemma on directed cycles and paths.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.19249 — 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-15T21:37:14.418Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).