← All problems

Guo–Zeng's strengthened truncated Gauss inequality for overpartitions

1 year old · traced to

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

(−1)k−1(p‾(n)+2∑j=1k(−1)jp‾(n−j2))+p‾(n−k2)≥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 n≥k2n\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.

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

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.