pith. sign in

arxiv: 2607.01969 · v1 · pith:B6YW4SNJnew · submitted 2026-07-02 · 🧮 math.NT

Genuine and strongly genuine polynomials: With an application to the persistence of Galois groups under specialization

Dante Bonolis , Lillian B. Pierce , Katharine Woo This is my paper

Pith reviewed 2026-07-03 06:59 UTC · model grok-4.3

classification 🧮 math.NT
keywords genuine polynomialsstrongly genuine polynomialsGalois group persistencespecializationreducibilitysplitting into linear factorsnumber fieldsmultivariate polynomials
0
0 comments X

The pith

Strongly n-genuine polynomials control counts of reducible specializations and thereby bound the number of integer points where Galois groups fail to persist.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines strongly n-genuine polynomials F(Y, X1, …, Xn) so that the number of specializations in the remaining variables that make F(Y, X1, x') reducible over the algebraic closure can be bounded quantitatively, and defines the larger class of n-genuine polynomials so that the number of specializations that split completely into linear factors in Y can be bounded. It proves that each class admits four equivalent characterizations. These classes are then used to show that, for an arbitrary polynomial F(Y, X1, …, Xn), the number of integer vectors x in Z^n such that the Galois group of F(Y, x) over Q differs from the generic Galois group over Q(X1, …, Xn) admits an explicit upper bound. The same conclusion holds when the base field is replaced by any number field.

Core claim

Strongly n-genuine polynomials are those for which the number of specializations F(Y, X1, x') with x' in Z^{n-1} (or F_p^{n-1}) that are reducible over the algebraic closure is controlled quantitatively; n-genuine polynomials are those for which the number that split completely into linear factors in Y is controlled. Each class has four equivalent characterizations, and both classes imply that for any input polynomial the set of integer specializations whose Galois group differs from the generic one is finite and bounded in size.

What carries the argument

n-genuine and strongly n-genuine polynomials, which supply quantitative upper bounds on the number of specializations that become reducible or split completely into linear factors.

If this is right

  • For every polynomial F the number of integer points x in Z^n at which Gal(F(Y, x)/Q) is not isomorphic to the generic Galois group is bounded above by a quantity depending only on the degree and n.
  • The same explicit upper bound holds when the base is the ring of integers of any number field instead of Z.
  • Verification that a given polynomial belongs to one of the two classes can be carried out by checking any of the four equivalent properties.
  • The bounds apply simultaneously to the geometric and arithmetic Galois groups in the function-field setting.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same quantitative control may be adaptable to other arithmetic invariants that are constant on a dense open set of the parameter space.
  • The method supplies a uniform way to produce thin sets of specializations on which Galois groups remain constant, independent of the specific form of F.

Load-bearing premise

The four listed characterizations of n-genuine and strongly n-genuine polynomials are equivalent, and the quantitative control they give on reducibility transfers directly to an upper bound on non-isomorphic Galois groups for arbitrary input polynomials.

What would settle it

An explicit polynomial F(Y, X1, …, Xn) together with a concrete integer vector count larger than the claimed upper bound on specializations whose Galois group differs from the generic one, or a counter-example showing that one of the four characterizations fails to imply another.

read the original abstract

We develop the theory of strongly $n$-genuine polynomials $F(Y,X_1,\ldots,X_n)$, which have the property that the number of specializations $F(Y,X_1,\mathbf{x}')$ with $\mathbf{x}'=(x_2,\ldots,x_n) \in \mathbb{Z}^{n-1}$ (respectively $\mathbf{x}' \in \mathbb{F}_p^{n-1}$) such that $F(Y,X_1,\mathbf{x}')$ is reducible over $\overline{\mathbb{Q}}$ (respectively over $\overline{\mathbb{F}}_p$) can be well-controlled quantitatively. We also develop the theory of a larger class of $n$-genuine polynomials $F(Y,X_1,\ldots,X_n)$, which have the property that the number of specializations $F(Y,X_1,\mathbf{x}')$ with $\mathbf{x}' \in \mathbb{Z}^{n-1}$ (respectively $\mathbf{x}' \in \mathbb{F}_p^{n-1}$) such that $F(Y,X_1,\mathbf{x}')$ splits completely over $\overline{\mathbb{Q}}$ (respectively over $\overline{\mathbb{F}}_p$) into factors that are linear in $Y$ can be well-controlled quantitatively. For each of these classes, we prove that there are four equivalent characterizations. As an application, we demonstrate that $n$-genuine and strongly $n$-genuine polynomials can be used to prove, for any polynomial $F(Y,X_1,\ldots,X_n)$, an upper bound for the number of specializations $F(Y,\mathbf{x})$ with $\mathbf{x}=(x_1,\ldots,x_n) \in \mathbb{Z}^n$ such that the Galois group of the splitting field of $F(Y,\mathbf{x})$ over $\mathbb{Q}$ is not isomorphic to the Galois group of the splitting field of $F(Y,X_1,\ldots,X_n)$ over $\mathbb{Q}(X_1,\ldots,X_n)$. We simultaneously prove analogous results over any number field.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper introduces n-genuine polynomials, which control the number of specializations F(Y,X1,x') (x' in Z^{n-1} or F_p^{n-1}) that split completely into linear factors in Y, and the subclass of strongly n-genuine polynomials, which control the number of specializations that are reducible over the algebraic closure. It proves that each class admits four equivalent characterizations. These are applied to obtain, for arbitrary F(Y,X1,...,Xn), an explicit upper bound on the number of integer points x in Z^n such that Gal(F(Y,x)/Q) is not isomorphic to the generic Galois group over Q(X1,...,Xn), together with the analogous statement over any number field.

Significance. If the four equivalences are valid and the reduction step from non-persistence to one of the controlled factorization behaviors holds, the work supplies a uniform quantitative tool for bounding exceptional specializations in Galois theory. This is relevant to effective Hilbert irreducibility, the inverse Galois problem, and arithmetic statistics, especially because the bounds apply simultaneously in characteristic zero and over finite fields and are stated for arbitrary input polynomials rather than special classes.

minor comments (3)
  1. [Abstract] The abstract states that four equivalent characterizations exist for each class but does not name them; adding a one-sentence indication of the nature of the characterizations (e.g., “in terms of height, resultant, or factorization patterns”) would improve readability without lengthening the abstract.
  2. [Introduction] The notation x' for the partial specialization (x2,...,xn) is introduced only in the abstract; a short sentence in §1 clarifying that the first variable X1 remains free while the remaining variables are specialized would prevent momentary confusion with the full specialization vector x.
  3. [Application] The transfer argument in the application section—that every non-persistent specialization must exhibit either reducibility or complete linear splitting—should be stated as a numbered lemma or proposition so that the quantitative bound follows by direct substitution of the estimates already proved for genuine polynomials.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript and for recommending minor revision. The assessment of the significance for effective Hilbert irreducibility and related areas is appreciated. No major comments appear in the report, so we have no specific points requiring point-by-point response at this stage. We will incorporate any minor suggestions during revision.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper introduces the new notions of n-genuine and strongly n-genuine polynomials, establishes four equivalent characterizations for each class via direct proofs, and then applies the resulting quantitative control on reducible or completely linearly splitting specializations to bound the set of specializations where the Galois group fails to persist. This chain relies on standard implications from algebraic geometry and Galois theory (non-persistent specializations must exhibit one of the controlled factorization types) without any reduction to self-referential definitions, fitted parameters renamed as predictions, or load-bearing self-citations. The argument is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper introduces new definitions and proves equivalences; it relies on standard facts about Galois groups and splitting fields but does not introduce fitted constants or new entities.

axioms (1)
  • standard math Standard facts about Galois groups of splitting fields over Q and over Q(X1,...,Xn)
    Invoked in the application section to compare specialized and generic Galois groups.

pith-pipeline@v0.9.1-grok · 5930 in / 1184 out tokens · 23804 ms · 2026-07-03T06:59:53.288505+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

24 extracted references · 4 canonical work pages · 1 internal anchor

  1. [1]

    Bucur, A

    A. Bucur, A. C. Cojocaru, M. N. Lal\' i n, and L. B. Pierce. Geometric generalizations of the square sieve, with an application to cyclic covers (with an appendix by Joseph Rabinoff ). Mathematika , 69:106--154, 2023

    2023

  2. [2]

    Buggenhout, R

    T. Buggenhout, R. Cluckers, P. Salberger, T. Santens, and F. Vermeulen. Serre's question on thin sets in projective space. (preprint arXiv:2506.13471) 2025

    work page arXiv 2025

  3. [3]

    D. Bonolis. A polynomial sieve and sums of D eligne type. Int. Math. Res. Not. IMRN , (2):1096--1137, 2021

    2021

  4. [4]

    Bonolis and L

    D. Bonolis and L. B. Pierce. Application of a polynomial sieve: beyond separation of variables. Algebra & Number Theory , 18(8):1515--1556, 2024. Correction, Algebra & Number Theory , to appear (2026)

    2024

  5. [5]

    Bonolis, L

    D. Bonolis, L. B. Pierce, and K. Woo. Counting integral points in thin sets of type II : singularities, sieves, and stratification. (preprint, arXiv:2505.11226) , 2025

    work page arXiv 2025

  6. [6]

    Bonolis, L

    D. Bonolis, L. B. Pierce, and K. Woo. Counting points in thin sets: a survey. (preprint, arXiv:2603.23334) , 2026

    work page arXiv 2026

  7. [7]

    Castillo and R

    A. Castillo and R. Dietmann. On H ilbert's irreducibility theorem. Acta Arith. , 180:1--14, 2017

    2017

  8. [8]

    S. D. Cohen. The distribution of G alois groups and H ilbert's irreducibility theorem. Proc. London Math. Soc. (3) , 43(2):227--250, 1981

    1981

  9. [9]

    Dietmann

    R. Dietmann. On the distribution of G alois groups. Mathematika , 58(1):35--44, 2012

    2012

  10. [10]

    M. D. Fried and M. Jarden. Field Arithmetic . Springer, Heidelberg, 4th edition, 2023

    2023

  11. [11]

    Grothendieck

    A. Grothendieck. EGA IV, \'El\'ements de g\'eom\'etrie alg\'ebrique : IV. \'Etude locale des sch\'emas et des morphismes de sch\'emas, Troisi\`eme partie . Publications Math\'ematiques de l'IH\'ES , 28:5--255, 1966

    1966

  12. [12]

    Hartshorne

    R. Hartshorne. Algebraic Geometry . Springer-Verlag, New York-Heidelberg, 1977. Graduate Texts in Mathematics, No. 52

    1977

  13. [13]

    D. R. Heath-Brown. The density of rational points on curves and surfaces. Ann. of Math. , 155:553--595, 2002

    2002

  14. [14]

    D. R. Heath-Brown and L. B. Pierce. Counting rational points on smooth cyclic covers. J. Number Theory , 132(8):1741--1757, 2012

    2012

  15. [15]

    N. M. Katz. Estimates for nonsingular multiplicative character sums. Int. Math. Res. Not. , 2002:333--349, 2002

    2002

  16. [16]

    S. Lang. Fundamentals of D iophantine G eometry . Springer-Verlag, New York, 1983

    1983

  17. [17]

    R. Munshi. Density of rational points on cyclic covers of P ^n . Journal de Th\' e orie des Nombres de Bordeaux , 21:335--341, 2009

    2009

  18. [18]

    Narkiewicz

    W. Narkiewicz. Elementary and Analytic Theory of Algebraic Numbers, 2nd. ed. Springer-Verlag, New York, 1990

    1990

  19. [19]

    Paredes and R

    M. Paredes and R. Sasyk. Effective H ilbert's irreducibility theorem for global fields. Israel J. Math. , 261(2):851--877, 2024

    2024

  20. [20]

    W. Schmidt. Equations over Finite Fields: An Elementary Approach . Lecture Notes in Mathematics 536. Springer-Verlag, 1976

    1976

  21. [21]

    J.-P. Serre. Topics in G alois theory , volume 1 of Research Notes in Mathematics . Jones and Bartlett Publishers, Boston, MA, 1992. Lecture notes prepared by H. Darmon

    1992

  22. [22]

    J.-P. Serre. Lectures on the M ordell- W eil theorem . Aspects of Mathematics. Friedr. Vieweg & Sohn, Braunschweig, 3rd edition, 1997. Translated from the French and edited by M. Brown from notes by M. Waldschmidt

    1997

  23. [23]

    Yasumoto

    M. Yasumoto. Algebraic extensions in nonstandard models and H ilbert's irreducibility theorem. J. Symbolic Logic , 53(2):470--480, 1988

    1988

  24. [24]

    D. Zywina. Hilbert's irreducibility theorem and the larger sieve (unpublished, arxiv:1011.6465), 2010

    work page internal anchor Pith review Pith/arXiv arXiv 2010