Effective Hilbert's Irreducibility Theorem for global fields
Marcelo Paredes, Rom\'an Sasyk

TL;DR
This paper establishes an effective version of Hilbert's irreducibility theorem for polynomials over global fields, providing explicit bounds on specializations that preserve irreducibility and Galois groups.
Contribution
It introduces explicit bounds for specializations in global fields, unifying the function field and number field cases with optimal bounds based on polynomial parameters.
Findings
Provides explicit bounds depending on polynomial height and degree
Unifies treatment of function field and number field cases
Bounds are optimal relative to the size of the specialization parameter
Abstract
We prove an effective form of Hilbert's irreducibility theorem for polynomials over a global field . More precisely, we give effective bounds for the number of specializations that do not preserve the irreducibility or the Galois group of a given irreducible polynomial . The bounds are explicit in the height and degree of the polynomial , and are optimal in terms of the size of the parameter . Our proofs deal with the function field and number field cases in a unified way.
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
TopicsAlgebraic Geometry and Number Theory · Coding theory and cryptography · Polynomial and algebraic computation
