Height bounds for exceptional Galois groups
For fixed degree and growing coefficient height, almost all polynomials have the largest group permitted by the family. The exceptional counts differ for ordinary and reciprocal polynomials.
ArticleRandom polynomials: models and methods
Random-polynomial theorems depend on the coefficient law and on whether degree or height grows. Irreducibility, alternating-group containment and the full symmetric group require different estimates.
ArticleLittlewood polynomials
Littlewood polynomials have coefficients ±1. Reduction modulo two gives deterministic criteria; Newton polygons prove high-probability irreducibility along special degrees.
ArticleFactor reversal for random binary polynomials
Reversing one factor preserves the reciprocal product. This identity underlies Kogler’s preprint on random binary polynomials.
ArticleCharacteristic polynomials of random matrices
Characteristic polynomials have dependent coefficients. Their irreducibility and Galois groups are studied through finite-field rank estimates.
ArticleRandom reciprocal polynomials of growing degree
Inverse pairs restrict the group of a reciprocal polynomial to a wreath product. A recent preprint claims irreducibility and three possible groups with high probability for uniform interval coefficients.
ArticleTwisted reciprocity and square discriminants
The pairing α ↦ b/α gives a trace polynomial. A discriminant identity then reduces the sign of the Galois action to a square-value condition.
ArticleReferences
- Die Seltenheit der reduziblen Gleichungen und der Gleichungen mit Affektvan der Waerden, B. L. · 1936
Studies the rarity of reducible polynomials and exceptional Galois groups in coefficient boxes as coefficient height grows with degree fixed.
- Reducible polynomialsChela, R. · 1963
Gives asymptotic counts of reducible integer polynomials in fixed-degree coefficient boxes, including the main contribution from linear factors. Reducibility is distinct from having an exceptional transitive Galois group.
- The large sieve and probabilistic Galois theoryGallagher, P. X. · 1973
Uses the large sieve to combine factorization information at many primes and bound exceptional Galois groups in fixed-degree integer coefficient boxes.
- On the distribution of Galois groupsDietmann, Rainer · 2012
Bounds the number of monic integer polynomials of fixed degree and bounded height with a prescribed Galois group, using resolvents and integral-point estimates.
- Enumerative Galois theory for cubics and quarticsChow, Sam and Dietmann, Rainer · 2020
Studies counts for individual Galois groups in degrees three and four, refining the question of how often the full symmetric group occurs.
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.