← All problems

Prellberg–Stanton nonnegativity conjecture

For integers n,mn,m with 0<m<n0<m<n, define the Gaussian polynomial by \qbinomnmq=∏j=1m1−qn−m+j1−qj\qbinom{n}{m}_q=\prod_{j=1}^{m}\frac{1-q^{n-m+j}}{1-q^j}. The Prellberg–Stanton conjecture asserts that, whenever nn is odd or m∉{2,n−2}m\notin\{2,n-2\}, every coefficient of the power series

(1−q)\qbinomnmq∏i=0m−111−qi+m(1-q)\qbinom{n}{m}_q\prod_{i=0}^{m-1}\frac{1}{1-q^{i+m}}

is nonnegative; equivalently, [qk]((1−q)\qbinomnmq∏i=0m−1(1−qi+m)−1)≥0[q^k]\left((1-q)\qbinom{n}{m}_q\prod_{i=0}^{m-1}(1-q^{i+m})^{-1}\right)\ge 0 for every k≥0k\ge 0.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

A new unrefereed preprint claims to prove the conjecture by establishing a broader coefficient-positivity result.

The Prellberg–Stanton conjecture concerns coefficientwise nonnegativity in a family of partition-theoretic power series.

Recent claimed proof

Hong-Zhang Ai, Lili Mu, and Bao-Xuan Zhu claim that Gaussian-polynomial corrections, partition injections, and the KOH identity prove nonnegativity for a broader power series, implying the Prellberg–Stanton conjecture. The preprint is unrefereed.

Current status (as of October 2026): A preprint claims the conjecture is proved, but the proof and its implication remain unverified.

Sources

Solutions 0

No solutions have been posted yet.