arXiv · 2611.10899
New lower bounds for even and odd values of the partition function
Abstract
Let $N_{\mathrm{odd}}(X)$ and $N_{\mathrm{even}}(X)$ denote the numbers of integers $0\leq n< X$ for which the ordinary partition function $p(n)$ is odd and even, respectively. The Parkin--Shanks conjecture predicts that $N_{\mathrm{odd}}(X)$ and $N_{\mathrm{even}}(X)$ are both asymptotic to $X/2$. Bellaïche and Nicolas proved that $N_{\mathrm{even}}(X)\gg \sqrt{X} \log \log X$, while Zheng, building on work of Ono and Swaminathan, recently proved that $N_{\mathrm{odd}}(X)\gg \sqrt{X}$. We improve both bounds simultaneously by proving $\min\{N_{\mathrm{odd}}(X), N_{\mathrm{even}}(X)\}\gg X^{3/4}/(\log X \log \log X)$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Liuquan Wang. 2026-11-07. New lower bounds for even and odd values of the partition function. https://searcharxiv.com/abs/2611.10899
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.