Guo–Zeng's strengthened truncated Gauss inequality for overpartitions

From papers

Let p(n)\overline{p}(n) denote the number of overpartitions of nn. For n,k1n,k\geq 1, Guo–Zeng's conjecture.

(1)k1(p(n)+2j=1k(1)jp(nj2))+p(nk2)0,(-1)^{k-1}\left(\overline{p}(n)+2\sum_{j=1}^k(-1)^j\overline{p}(n-j^2)\right)+\overline{p}(n-k^2)\geq 0,

with strict inequality if nk2n\geq k^2. The conjecture was proved independently by Mao in 2015 and Yee in 2015, and later reconfirmed by Wang and Yee in 2019.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Thomas Y. He and S. Y. Liu, “Combinatorial interpretation of a truncated identity of Gauss”, arXiv:2509.01216 (2025).

Solutions 0

No solutions have been posted yet.