A random polynomial with multiplicative coefficients is almost surely irreducible
P\'eter P. Varj\'u, Max Wenqiang Xu

TL;DR
Under the assumption of the Riemann hypothesis for Dedekind zeta functions, this paper proves that a random polynomial with multiplicative ±1 coefficients is almost surely irreducible as degree increases.
Contribution
It establishes a probabilistic irreducibility result for polynomials with multiplicative ±1 coefficients under a key number-theoretic hypothesis.
Findings
Probability of reducibility decreases as degree increases
Almost sure irreducibility under the Riemann hypothesis assumption
Quantitative bounds on irreducibility probability
Abstract
Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree polynomial with random multiplicative coefficients is irreducible in with probability .
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
TopicsAnalytic Number Theory Research · Geometry and complex manifolds · Meromorphic and Entire Functions
