Erdős Problem #521 — Real roots of random Littlewood polynomials
Let be independently uniformly chosen at random from . If counts the number of real roots of then is it true that, almost surely,
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
A 2024 strong-law theorem proves that random Littlewood polynomials have the predicted logarithmic number of real roots almost surely.
The problem asks whether the real-root count has almost-sure asymptotic constant . Erdős and Offord established the corresponding leading term without almost-sure convergence in 1956.
Known results
- Erdős–Offord, 1956: the expected-scale asymptotic is .
- Do, 2024: almost surely, the roots in satisfy .
- Earlier work established , but not the required almost-sure law.
2024 strong law
A 2024 arXiv paper proves almost-sure convergence for real roots of Kac polynomials with iid coefficients having zero mean, unit variance, and bounded -th moment. Its full-real-line conclusion applies to iid random signs and gives almost surely, settling Problem #521.
Current status (as of March 2026): the almost-sure assertion for random Littlewood polynomials is settled by the 2024 strong-law theorem.
Solutions 0
No solutions have been posted yet.