Law of large numbers for the discriminant of random polynomials
Marcus Michelen, Oren Yakir

TL;DR
This paper establishes a law of large numbers for the discriminant of random polynomials with i.i.d. coefficients, showing its asymptotic behavior with high probability as the degree grows large.
Contribution
It provides the first rigorous asymptotic formula for the discriminant of random polynomials with i.i.d. coefficients, including an explicit universal constant.
Findings
Discriminant magnitude concentrates around a specific exponential scale
Asymptotic formula involves a universal constant ${ m D}_igstar$
Analytic representation captures root symmetry and cancellations
Abstract
Let be a random polynomial of degree , whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let denote the discriminant of , that is where is the leading coefficient of and are its roots. We prove that with high probability as , for some explicit universal constant . A key step in the proof is an analytic representation for the logarithm of the discriminant, which captures both the distributional reciprocal symmetry of the random roots and the cancellations this symmetry induces.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption
