the limit point set of real roots of random polynomials: a resolution of erdős problem 521
We resolve Erdős Problem~521 by proving that the normalized real-root count $N_n/\log n$ of Rademacher polynomials almost surely has no limit. More generally, consider the Kac polynomials \[ P_n(x)=\sum_{j=0}^{n}ξ_jx^j \] with i.i.d.\ real coefficients of mean zero, variance one, and a finite absolute exponential moment. Let $N_n$ denote the number of distinct real roots of $P_n$. We prove that, almost surely, \[ \liminf_{n\to\infty}\frac{N_n}{\log n}=\frac1π, \qquad \limsup_{n\to\infty}\frac{N_n}{\log n}=\frac1π+C_*, \] and the set of subsequential limits is exactly \[ \left[\frac1π,\;\frac1π+C_*\right]. \] Here $C_*>1/π$ is a constant uniquely determined by an equation. The lower-limit identity remains valid under the weaker assumption that $\mathbb{E}|ξ_0|^{2+δ}<\infty$ for some $δ>0$.
Authors
- Mingjian Zhang (ORCID: https://orcid.org/0000-0002-7731-6113)
- Jie Peng (ORCID: https://orcid.org/0000-0003-4040-0327)
- Zengjing Chen
- Hanchao Wang
- Xiaodong Liu
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.16157
- Primary Topic
- Random Matrices and Applications
- Type
- preprint