References

389 books, papers, notes, databases, and software sources.

References include annotations, publication status, and source links. Full-text access depends on the provider.

001
Book1979Serre1979

Local Fields

Serre, Jean-Pierre. Springer, Graduate Texts in Mathematics, vol. 67, 1979.

Treats valuations, ramification, the different, and discriminants. These provide the local field framework for Newton polygons and for constructing inertia elements in polynomial Galois groups.

Status and links

Status: Published book · checked 2026-11-11

English translation of Corps locaux by Marvin Jay Greenberg.

Cited in: Ramification and inertia

002
Book1997LidlNiederreiter1997

Finite Fields

Lidl, Rudolf and Niederreiter, Harald. Edition 2. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 20, 1997.

Treats irreducible and primitive polynomials over finite fields, factorization, and constructions. An irreducible polynomial of degree n over a finite field has cyclic splitting-field group of order n; Galois groups over the rationals need not be cyclic.

Status and links

Status: Published book · checked 2026-11-11

The standard bibliographic year is 1997 (BNF and AMS review); the Cambridge product page lists a 24 October 1996 release date.

Cited in: Trinomials · Littlewood polynomials · Gleason and Misiurewicz polynomials · Finite fields and Frobenius · Irreducibility over finite fields · Irreducible polynomials with coefficient restrictions · Primitive and normal elements · Factorization statistics over finite fields · Sparse irreducible polynomials over finite fields

003
Book1999Neukirch1999

Algebraic Number Theory

Neukirch, Jürgen. Springer, Grundlehren der mathematischen Wissenschaften, vol. 322, 1999.

Treats prime decomposition, ramification, and the global arithmetic of splitting fields, relating reduction modulo primes to arithmetic properties of number fields.

Status and links

Status: Published book · checked 2026-11-11

Translated from German by Norbert Schappacher.

Cited in: Discriminants, parity, and ramification · Trinomials · Algorithms for Galois groups

004
Book2000Schinzel2000

Polynomials with Special Regard to Reducibility

Schinzel, Andrzej. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 77, 2000.

Treats arbitrary and lacunary polynomials over several classes of fields. Its bibliography documents the classical literature on reducibility.

Status and links

Status: Published book · checked 2026-11-11

The monograph treats several broad field classes. Its publisher explicitly excludes results valid only over finite fields, local fields, or the rational field; use it together with field-specific references.

Cited in: Foundations: polynomials, fields, and Galois groups · Root bounds and prime-value criteria · Sparse polynomials and factor reversal · Capelli’s theorem and polynomial composition · Composition and iteration · Irreducibility of iterates · Polynomials with separated variables

005
Book2002Lang2002

Algebra

Lang, Serge. Edition 3. Springer, Graduate Texts in Mathematics, vol. 211, 2002.

Develops the algebra of irreducibility, field extensions, and Galois theory over general fields, including the distinction between separability and irreducibility.

Status and links

Status: Published book · checked 2026-11-11

Cited in: Foundations: polynomials, fields, and Galois groups · Field extensions and minimal polynomials · Capelli’s theorem and polynomial composition · Polynomials in several variables

006
Book2004Prasolov2004

Polynomials

Prasolov, Victor V. Springer, Algorithms and Computation in Mathematics, vol. 11, 2004.

Treats irreducibility on pp. 47–76, special polynomial forms on pp. 77–131, and Galois theory on pp. 181–218, relating algebraic arguments to root location and explicit constructions.

Status and links

Status: Published book · checked 2026-11-11

The English first edition is ©2004 (hardcover published 9 July 2004); the linked eBook was released 23 September 2009. These are editions/formats of the same book.

Cited in: Foundations: polynomials, fields, and Galois groups · Reduction modulo primes · Root bounds and prime-value criteria

007
Book2012Cox2012

Galois Theory

Cox, David A. Edition 2. John Wiley & Sons, 2012.

Develops field extensions and explicit Galois-group calculations through worked examples. Chapters 13 and 14 treat resolvents, computation, and solvable permutation groups.

Status and links

Status: Published book · checked 2026-11-11

Cited in: Foundations: polynomials, fields, and Galois groups · The Galois correspondence and intermediate fields · Discriminants, parity, and ramification · Transitivity, primitivity, and cycle criteria · Resolvents and subgroup tests · Reciprocal polynomials · Taylor polynomials · Bernoulli and Euler polynomials · Fekete polynomials · Touchard polynomials · Tutte polynomials · Twisted reciprocity and square discriminants · Algorithms for Galois groups

008
Book2022Milne2022

Fields and Galois Theory

Milne, James S. Kea Books, 2022.

Develops field and Galois theory through proofs and examples; Chapter 4 treats Galois-group computation. The linked file is the 2022 book. The author’s errata address, among other points, irreducibility in Q[X] versus Z[X] and the degree-two exception in polynomial counting. The frozen course notes v5.10 have different pagination.

Status and links

Status: Published book; author errata available · checked 2026-11-12

Author errata: https://www.jmilne.org/math/Books/fterrata.html. Course-note version 5.10 is frozen; the author directs readers to the book for corrections and updates.

Cited in: Foundations: polynomials, fields, and Galois groups · Field extensions and minimal polynomials · The Galois correspondence and intermediate fields · Newton polygons and Galois groups · Capelli’s theorem and polynomial composition · Frobenius and factorization modulo primes · Discriminants, parity, and ramification · Transitivity, primitivity, and cycle criteria · Reciprocal polynomials · Specialization and Hilbert irreducibility

009
Paper1846schoenemann1846

Von denjenigen Moduln, welche Potenzen von Primzahlen sind. (Fortsetzung)

Schönemann, Theodor. Journal für die reine und angewandte Mathematik, 32, 93–105, 1846.

Precedes Eisenstein’s treatment of the criterion now often called Schönemann–Eisenstein. Cox’s historical account explains the role of higher congruences and translates the statement into modern polynomial language.

Status and links

Status: published · checked 2026-11-11

Cited in: Schönemann–Eisenstein and Dumas criteria

010
Paper1850eisenstein1850

Über die Irreductibilität und einige andere Eigenschaften der Gleichung, von welcher die Theilung der ganzen Lemniscate abhängt

Eisenstein, Gotthold. Journal für die reine und angewandte Mathematik, 39, 160–179, 1850.

Develops Eisenstein’s criterion in connection with division of the lemniscate and Gaussian integers. For an integer polynomial, the familiar criterion requires a prime dividing every nonleading coefficient but not the leading coefficient, with its square not dividing the constant coefficient.

Status and links

Status: published · checked 2026-11-11

Cited in: Schönemann–Eisenstein and Dumas criteria

011
Paper1901capelli1901binomials

Sulla riduttibilità della funzione x^n-A in un campo qualunque di razionalità

Capelli, Alfredo. Mathematische Annalen, 54, 602–603, 1901.

Classical reference for the binomial irreducibility criterion, including the exceptional fourth-power obstruction when the exponent is divisible by four. Distinguish this binomial criterion from the related Capelli composition lemma; the note itself points back to Capelli's 1897 and 1898 work.

Status and links

Status: published · checked 2026-11-11

Cited in: Newton polygons and Galois groups · Capelli’s theorem and polynomial composition

012
Paper1906dumas1906

Sur quelques cas d'irréductibilité des polynômes à coefficients rationnels

Dumas, Gustave. Journal de Mathématiques Pures et Appliquées, 6e série, 2, 191–258, 1906.

Uses Newton polygons to restrict possible factor degrees. In the one-edge case, coprime horizontal and vertical increments give an irreducibility criterion; the polygon-product rule applies to more general factorization questions.

Status and links

Status: published · checked 2026-11-12

Cited in: Schönemann–Eisenstein and Dumas criteria · Newton polygons and Galois groups · Capelli’s theorem and polynomial composition

013
Paper1907perron1907

Neue Kriterien für die Irreduzibilität algebraischer Gleichungen

Perron, Oskar. Journal für die reine und angewandte Mathematik, 132, 288–307, 1907.

Classical criteria based on coefficient dominance and the location of complex roots. A standard application is a monic integer polynomial with nonzero constant term and next-to-leading coefficient larger in absolute value than one plus the sum of the lower coefficient magnitudes.

Status and links

Status: published · checked 2026-11-11

Cited in: Root bounds and prime-value criteria

014
Paper1908schur1908problem226

Problem 226

Schur, Issai. Archiv der Mathematik und Physik, 3, 13, 367, 1908.

Original question on products of distinct integral linear factors perturbed by ±1. The link is to the later historical account that verifies this citation, rather than to a scan of the original problem; that account also records Schur's Problem275 (1909) on power compositions.

Status and links

Status: published; citation verified indirectly · checked 2026-11-11

The main link identifies Győry–Hajdu–Tijdeman (2011), the later source used to verify the historical citation, rather than an original scan.

Cited in: Irreducibility from integer values

015
Paper1919polya1919

Verschiedene Bemerkungen zur Zahlentheorie

Pólya, George. Jahresbericht der Deutschen Mathematiker-Vereinigung, 28, 31–40, 1919.

Original source for irreducibility criteria obtained from sufficiently small nonzero values at many distinct integers. The interpolation argument and later improvements are developed in Levit1968, Tverberg1973 and Győry–Hajdu–Tijdeman2011.

Status and links

Status: published · checked 2026-11-11

Cited in: Irreducibility from integer values

016
Paper1923ore1923criteria

Zur Theorie der Irreduzibilitätskriterien

Ore, Øystein. Mathematische Zeitschrift, 18, 278–288, 1923.

Extends valuation-based irreducibility criteria beyond the Eisenstein and Dumas cases, preceding the development of augmented valuations and higher-order Newton polygons.

Status and links

Status: published · checked 2026-11-11

DOI, volume 18, pages 278–288, and December 1923 publication date checked against the publisher. The original 1922 date is the received date, not the publication year.

Cited in: Not cited in an article.

017
Paper1933dorwartore1933

Criteria for the irreducibility of polynomials

Dorwart, H. L. and Ore, Øystein. Annals of Mathematics, 34(1), 81–94, 1933.

Studies irreducibility from repeated small or prime values at integer arguments and extends Schur-type constructions involving products of linear factors.

Status and links

Status: published · checked 2026-11-11

Cited in: Not cited in an article.

018
Paper1935dorwart1935survey

Irreducibility of polynomials

Dorwart, H. L. The American Mathematical Monthly, 42(6), 369–381, 1935.

Surveys classical criteria based on coefficient divisibility, coefficient size, and values at integers. Its bibliography records the literature available at the time.

Status and links

Status: published · checked 2026-11-11

Cited in: Not cited in an article.

019
Paper1936maclane1936values

A construction for absolute values in polynomial rings

MacLane, Saunders. Transactions of the American Mathematical Society, 40(3), 363–395, 1936.

Constructs polynomial valuations through successive augmentations and key polynomials. This framework supports irreducibility tests beyond a first Newton polygon and underlies modern local factorization methods.

Status and links

Status: published · checked 2026-11-11

Cited in: Not cited in an article.

020
Paper1965schinzel1965trinomials

On the reducibility of polynomials and in particular of trinomials

Schinzel, Andrzej. Acta Arithmetica, 11(1), 1–34, 1965.

Studies structural reducibility, especially for sparse polynomials and trinomials. Specific statements should be read with the 1966 errata.

Status and links

Status: published; errata available · checked 2026-11-11

Cited in: Not cited in an article.

021
Paper1966schinzel1966errata

Errata to the paper "On the reducibility of polynomials and in particular of trinomials"

Schinzel, Andrzej. Acta Arithmetica, 11(4), 491, 1966.

Corrects statements in Schinzel’s 1965 paper; the correction and original paper should be consulted together.

Status and links

Status: published erratum · checked 2026-11-12

The publisher page confirms the citation and DOI. The DOI resolver returned 404 on 12 November 2026; the Source link uses the working publisher page.

Cited in: Not cited in an article.

022
Paper1968levit1968

Irreducibility of polynomials with low absolute values

Levit, R. J. Transactions of the American Mathematical Society, 132(2), 297–305, 1968.

Sharpens the interpolation bounds in Pólya’s small-value criterion. Its exclusions of factors of specified degrees can be combined with local degree restrictions.

Status and links

Status: published · checked 2026-11-11

Cited in: Irreducibility from integer values

023
Paper1973tverberg1973smallvalues

On the irreducibility of polynomials taking small values

Tverberg, Helge. Mathematica Scandinavica, 32, 5–21, 1973.

Refines the small-value method, including asymptotic bounds, extending the interpolation arguments of Pólya and Levit.

Status and links

Status: published · checked 2026-11-11

Cited in: Irreducibility from integer values

024
Paper1981brillhartfilasetaodlyzko1981

On an irreducibility theorem of A. Cohn

Brillhart, John and Filaseta, Michael and Odlyzko, Andrew. Canadian Journal of Mathematics, 33(5), 1055–1059, 1981.

Generalizes the criterion that a prime’s digit expansion gives an irreducible polynomial when its digits are used as coefficients. It identifies coefficient restrictions under which a single prime evaluation proves irreducibility.

Status and links

Status: published · checked 2026-11-11

Cited in: Root bounds and prime-value criteria

025
Paper1997khandujasaha1997

On a generalization of Eisenstein's irreducibility criterion

Khanduja, Sudesh K. and Saha, Jayanti. Mathematika, 44(1), 37–41, 1997.

Extends the Eisenstein method over valued fields to coefficient patterns beyond the ordinary divisibility criterion.

Status and links

Status: published · checked 2026-11-11

Cited in: Not cited in an article.

026
Paper1999filaseta1999smallnorm

On the factorization of polynomials with small Euclidean norm

Filaseta, Michael. Number Theory in Progress, Vol. 1, de Gruyter, 143–163, 1999.

Uses the Euclidean norm of the coefficient vector to constrain factorization, including that of sparse polynomials and their nonreciprocal parts. Irreducibility of the nonreciprocal part does not imply irreducibility of the whole polynomial.

Status and links

Status: published · checked 2026-11-11

Pages143–163 follow the author's bibliography and MathSciNet citation reproduced in Sawin–Shusterman–Stoll; the publisher chapter wrapper gives143–164, apparently including a trailing page.

Cited in: Sparse polynomials and factor reversal · Factor reversal for random binary polynomials

027
Paper2000filasetafordkonyagin2000

On an irreducibility theorem of A. Schinzel associated with coverings of the integers

Filaseta, Michael and Ford, Kevin and Konyagin, Sergei. Illinois Journal of Mathematics, 44(3), 633–643, 2000.

For large exponents, controls the nonreciprocal part of f(x)x^n+g(x), assuming coprimality, nonzero constant terms of both f and g, and explicit Capelli-type exclusions. The method improves the threshold in Schinzel's theorem and connects sparse factorization to covering systems.

Status and links

Status: published · checked 2026-11-11

Cited in: Sparse polynomials and factor reversal

028
Paper2002murty2002primevalues

Prime numbers and irreducible polynomials

Murty, M. Ram. The American Mathematical Monthly, 109(5), 452–458, 2002.

Relates prime values, coefficient bounds, and irreducibility, with Cohn’s theorem as an example. A single prime value requires additional size or coefficient hypotheses; the paper states such hypotheses.

Status and links

Status: published · checked 2026-11-11

Cited in: Root bounds and prime-value criteria

029
Paper2007thangadurai2007survey

Irreducibility of polynomials whose coefficients are integers

Thangadurai, R. RMS Mathematical Newsletter, 17(2), 29–37, 2007.

Surveys classical tests for rational irreducibility of integer polynomials and explains their limitations.

Status and links

Status: published · checked 2026-11-11

The author’s bibliography confirms RMS Mathematical Newsletter 17(2) (2007), 29–37. A distinct 2009 chapter with the same title is coauthored with N. Saradha.

Cited in: Not cited in an article.

030
Paper2011cox2011eisenstein

Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First

Cox, David A. The American Mathematical Monthly, 118(1), 3–21, 2011.

Explains the history and mathematics of Eisenstein’s criterion through Gauss’s lemma, finite fields, Hensel lifting, Gaussian integers, and lemniscatic division. It distinguishes the arguments and contributions of Schönemann and Eisenstein.

Status and links

Status: published · checked 2026-11-12

The cited Monthly version (2011), pp. 3–21, is a reprint with minor changes of the article in Normat 57(2) (2009), pp. 49–73; the Monthly first-page footnote explicitly acknowledges the earlier publication. Publisher online migration date 13 December 2017 is not the publication year.

Cited in: Foundations: polynomials, fields, and Galois groups · Schönemann–Eisenstein and Dumas criteria

031
Paper2011gyoryhajdutijdeman2011

Irreducibility criteria of Schur-type and Pólya-type

Győry, Kálmán and Hajdu, Lajos and Tijdeman, Robert. Monatshefte für Mathematik, 163(4), 415–443, 2011.

Research paper with a substantial historical introduction and bibliography on small-value criteria, perturbed products and compositions. Its extensions use interpolation, algebraic number theory and Diophantine approximation, including results over imaginary quadratic rings and compositions of CM type.

Status and links

Status: published · checked 2026-11-11

Cited in: Irreducibility from integer values

032
Paper2015bonciocat2015multiprime

Schönemann–Eisenstein–Dumas-type irreducibility conditions that use arbitrarily many prime numbers

Bonciocat, Nicolae Ciprian. Communications in Algebra, 43(8), 3102–3122, 2015.

Combines coefficient divisibility at several primes through Newton polygons. Intersecting the permitted factor degrees can exclude every proper factor even when each prime alone is inconclusive.

Status and links

Status: published · checked 2026-11-12

Published in 2015; open author preprint v2 dated 21 March 2014. Theorem A gives the several-prime factor-degree intersection criterion. The former secondary verification link DOI 10.1090/proc/14856 is replaced by this paper’s own primary text.

Cited in: Foundations: polynomials, fields, and Galois groups · Reduction modulo primes · Schönemann–Eisenstein and Dumas criteria · Newton polygons and Galois groups

033
Paper2016coledunnfilaseta2016

Further irreducibility criteria for polynomials with non-negative coefficients

Cole, Morgan and Dunn, Scott and Filaseta, Michael. Acta Arithmetica, 175(2), 137–181, 2016.

Continues the Cohn prime-value approach for nonnegative integer coefficients. It determines sharp coefficient bounds for bases from 3 through 20, allowing coefficients larger than ordinary base digits while retaining an irreducibility conclusion from a prime evaluation.

Status and links

Status: published · checked 2026-11-11

Cited in: Not cited in an article.

034
Paper2020filasetali2020

On the irreducibility of the non-reciprocal part of polynomials of the form f(x)x^n+g(x)

Filaseta, Michael and Li, Huixi and Patane, Frank and Skabelund, Dane. Acta Arithmetica, 196(2), 187–201, 2020.

Improves the sufficient exponent threshold in the robust-pair method of Sawin, Shusterman and Stoll. The conclusion concerns the nonreciprocal part, so reciprocal factors still require separate analysis when proving full irreducibility.

Status and links

Status: published · checked 2026-11-11

Cited in: Not cited in an article.

035
Paper2020sawinshustermanstoll2020

Irreducibility of polynomials with a large gap

Sawin, Will and Shusterman, Mark and Stoll, Michael. Acta Arithmetica, 192(2), 111–139, 2020.

Develops Ljunggren’s factor-reversal method into irreducibility algorithms for x^N c(x^-1)+d(x). It treats cyclotomic obstructions separately, improves effective bounds under additional robustness hypotheses, and reviews earlier large-gap results.

Status and links

Status: published · checked 2026-11-11

Cited in: Sparse polynomials and factor reversal · Factor reversal for random binary polynomials

036
Paper1871Jordan1871

Théorèmes sur les groupes primitifs

Jordan, Camille. Journal de Mathématiques Pures et Appliquées (2), 16, 383–408, 1871.

Establishes primitive-group results used to prove containment of A_n in polynomial Galois groups. Modern expositions give the prime-cycle criterion in current terminology, including its primitivity hypothesis.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Newton polygons and Galois groups · Transitivity, primitivity, and cycle criteria

037
Book1996DixonMortimer1996

Permutation Groups

Dixon, John D. and Mortimer, Brian. Graduate Texts in Mathematics 163, Springer, 1996.

Treats transitivity, block systems, primitive groups, and Jordan-type criteria for large permutation groups. These criteria apply once modular factorization or local ramification has supplied cycle information.

Status and links

Status: Published monograph · checked 2026-11-11

Cited in: Foundations: polynomials, fields, and Galois groups · The Galois correspondence and intermediate fields · Newton polygons and Galois groups · Transitivity, primitivity, and cycle criteria

038
Paper1996StevenhagenLenstra1996

Chebotarëv and his density theorem

Stevenhagen, Peter and Lenstra, Jr., Hendrik W. The Mathematical Intelligencer, 18(2), 26–37, 1996.

Explains Frobenius conjugacy classes and their relation to splitting modulo primes, with the history and proof of Chebotarev’s theorem. It describes what modular factorization data can establish and what remains undetermined.

Status and links

Status: Published expository article · checked 2026-11-11

Cited in: Foundations: polynomials, fields, and Galois groups · Reduction modulo primes · Frobenius and factorization modulo primes · Taylor polynomials and Katz–Rivin questions · Characteristic polynomials of random matrices

039
Paper2014Jones2014Cycles

Primitive permutation groups containing a cycle

Jones, Gareth A. Bulletin of the Australian Mathematical Society, 89(1), 159–165, 2014.

Classifies primitive finite permutation groups containing a cycle and strengthens Jordan’s prime-cycle theorem. Theorems 1.1–1.2 and Corollary 1.3 justify the cycle criteria used here. Prefer the published version: Remark 1.9 corrects the older preprint’s distinction between polynomial composition and primitivity of a fixed polynomial’s root action.

Status and links

Status: Published article · checked 2026-11-12

Published online 18 July 2013; journal issue February 2014. Use the published text: preprint Comments 1 and 3 became Remarks 1.4 and 1.6, and the inaccurate fixed-polynomial indecomposability claim in arXiv v1 Comment 6 was corrected to a divisibility criterion in published Remark 1.9.

Cited in: Transitivity, primitivity, and cycle criteria · Hermite, Bessel, and Legendre polynomials

040
Paper1977LagariasOdlyzko1977

Effective versions of the Chebotarev density theorem

Lagarias, Jeffrey C. and Odlyzko, Andrew M. In Fröhlich, Albrecht (editor), Algebraic Number Fields: L-functions and Galois Properties (Proc. Sympos., Univ. Durham, Durham, 1975), Academic Press, 409–464, 1977.

Gives conditional and unconditional effective Chebotarev estimates. These bound the primes with specified Frobenius conjugacy classes.

Status and links

Status: Published proceedings chapter · checked 2026-11-11

The main link is Lagarias’s bibliography, which verifies the 1977 proceedings chapter (pp. 409–464); it is not a full-text link.

Cited in: Not cited in an article.

041
Paper1981Cohen1981Hilbert

The Distribution of Galois Groups and Hilbert's Irreducibility Theorem

Cohen, Stephen D. Proceedings of the London Mathematical Society (3), 43(2), 227–250, 1981.

Gives quantitative bounds for exceptional specializations and Galois-group distributions in polynomial families by combining Hilbert irreducibility with sieve estimates.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

042
Paper1981Serre1981Chebotarev

Quelques applications du théorème de densité de Chebotarev

Serre, Jean-Pierre. Publications Mathématiques de l'IHÉS, 54, 123–201, 1981.

Develops effective Chebotarev estimates and arithmetic applications, specifying the dependence on analytic hypotheses, extension degrees, and discriminants.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

043
Paper2019ThornerZaman2019Chebotarev

A unified and improved Chebotarev density theorem

Thorner, Jesse and Zaman, Asif. Algebra & Number Theory, 13(5), 1039–1068, 2019.

Gives an unconditional effective Chebotarev theorem with improved uniformity, including a possible exceptional zero. Its parameter dependence determines when an unconditional estimate can replace a GRH-based estimate in a probabilistic or computational argument.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

045
Paper1960Ljunggren1960

On the irreducibility of certain trinomials and quadrinomials

Ljunggren, Wilhelm. Mathematica Scandinavica, 8, 65–70, 1960.

Studies factorization of sparse polynomials through the distinction between reciprocal and nonreciprocal factors. Its factor-reversal method extends to later large-gap problems.

Status and links

Status: Published · checked 2026-11-11

Cited in: Sparse polynomials and factor reversal · Trinomials · Factor reversal for random binary polynomials

046
Paper1979NartVila1979

Equations of the type X^n+aX+b with absolute Galois group S_n

Nart, Enric and Vila, Núria. Revista de la Universidad de Santander, 2, 821–825, 1979.

An early source for symmetric Galois groups of trinomials; in particular, it precedes Osada for x^n-x-1. The institutional catalogue supplies an English title although the original paper is in Spanish.

Status and links

Status: Published · checked 2026-11-11

Cited in: Trinomials

047
Paper1987Osada1987

The Galois groups of the polynomials X^n+aX^l+b

Osada, Hiroyuki. Journal of Number Theory, 25(2), 230–238, 1987.

Gives arithmetic conditions forcing the full symmetric group for trinomials, using ramification to obtain transpositions. It includes an independent proof for x^n-x-1.

Status and links

Status: Published · checked 2026-11-11

Cited in: Trinomials

048
Paper1997CohenMovahhediSalinier1997

Double transitivity of Galois groups of trinomials

Cohen, Stephen D. and Movahhedi, A. and Salinier, Alain. Acta Arithmetica, 82(1), 1–15, 1997.

Studies how arithmetic hypotheses on a trinomial force double transitivity. This is an intermediate group-theoretic step that can be combined with cycle or ramification information to obtain a large Galois group.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

049
Paper1999CohenMovahhediSalinier1999

Galois groups of trinomials

Cohen, Stephen D. and Movahhedi, A. and Salinier, Alain. Journal of Algebra, 222(2), 561–573, 1999.

Extends earlier results of Osada using primitivity, cycle structure, and arithmetic restrictions. Apply the precise irreducibility and coprimality assumptions in the paper rather than treating sparsity alone as a sufficient condition.

Status and links

Status: Published · checked 2026-11-11

Cited in: Trinomials

050
Paper1929Schur1929I

Einige Sätze über Primzahlen mit Anwendungen auf Irreduzibilitätsfragen, I

Schur, Issai. Sitzungsberichte der Preußischen Akademie der Wissenschaften, Physikalisch-Mathematische Klasse, 125–136, 1929.

Classical prime-divisor arguments applied to irreducibility. Read alongside Part II and the 1930/1931 papers to trace the origin of factorial-coefficient and orthogonal-polynomial methods.

Status and links

Status: Published; citation verified through later literature · checked 2026-11-11

The linked source is Rabarison–Pazuki–Molin (2024), bibliography entry [20], which verifies the original citation. It is not a scan of Schur’s 1929 paper.

Cited in: Not cited in an article.

051
Paper1930Schur1930

Gleichungen ohne Affekt

Schur, Issai. Sitzungsberichte der Preußischen Akademie der Wissenschaften, Physikalisch-Mathematische Klasse, 443–449, 1930.

Proves the Galois-group theorem for exponential Taylor polynomials. Coleman later gives a proof using Newton polygons.

Status and links

Status: Published; citation verified through later literature · checked 2026-11-11

The linked source is Rabarison–Pazuki–Molin (2024), bibliography entry [22], which verifies the original citation. It is not a scan of Schur’s 1930 paper.

Cited in: Taylor polynomials

052
Paper1931Schur1931

Affektlose Gleichungen in der Theorie der Laguerreschen und Hermiteschen Polynome

Schur, Issai. Journal für die reine und angewandte Mathematik, 165, 52–58, 1931.

Studies irreducibility and Galois groups of Laguerre and Hermite polynomials. Statements for Hermite polynomials must account for parity and the forced factor at zero.

Status and links

Status: Published · checked 2026-11-11

Cited in: Generalized Laguerre polynomials · Hermite, Bessel, and Legendre polynomials

053
Paper1987Coleman1987

On the Galois groups of the exponential Taylor polynomials

Coleman, Robert F. L'Enseignement Mathématique, 33, 183–189, 1987.

Proves Schur’s theorem for sum_{j=0}^n x^j/j!: irreducible over Q, with group A_n when 4 divides n and S_n otherwise (n at least 2). The proof combines Newton-polygon slopes, long cycles, and the discriminant square test.

Status and links

Status: Published · checked 2026-11-11

Cited in: Newton polygons and Galois groups · Taylor polynomials

054
Paper2004Martin2004

The Galois group of x^n-x^{n-1}-...-x-1

Martin, Paulo A. Journal of Pure and Applied Algebra, 190(1--3), 213–223, 2004.

Proves that the generalized Fibonacci polynomial has group S_n when n is even or prime. The prime-degree argument includes irreducibility of its reduction modulo that prime.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

055
Paper2007FilasetaKumchevPasechnik2007

On the irreducibility of a truncated binomial expansion

Filaseta, Michael and Kumchev, Angel and Pasechnik, Dmitrii. Rocky Mountain Journal of Mathematics, 37(2), 455–464, 2007.

Studies irreducibility of the first k+1 terms of (1+x)^n and related coefficient families through factorial-coefficient criteria.

Status and links

Status: Published · checked 2026-11-11

Cited in: Truncated binomial polynomials

056
Paper2011ChambertLoir2011

The theorem of Jentzsch--Szegő on an analytic curve: application to the irreducibility of truncations of power series

Chambert-Loir, Antoine. International Journal of Number Theory, 7(7), 1807–1823, 2011.

Relates zero-distribution on analytic curves, including nonarchimedean curves, to irreducibility information for truncations. Use the corrected published version or arXiv v3; the arXiv history specifically records a correction to the application.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

057
Paper2018FilasetaMoy2018

On the Galois group over Q of a truncated binomial expansion

Filaseta, Michael and Moy, Richard. Colloquium Mathematicum, 154(2), 295–308, 2018.

For a fixed truncation degree r other than 6, proves that sufficiently large n gives S_r for the first r+1 terms of (1+x)^n. At r=6 it bounds the number of exceptions n up to N by O(log N).

Status and links

Status: Published · checked 2026-11-11

Cited in: Truncated binomial polynomials

058
Paper2019ShokriShaffafTaleb2019

Galois groups of Taylor polynomials of some elementary functions

Shokri, Khosro Monsef and Shaffaf, Jafar and Taleb, Reza. International Journal of Number Theory, 15(6), 1127–1141, 2019.

Studies truncations associated with logarithmic and cosine functions. The cosine examples naturally involve a signed-permutation group because of their even symmetry.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

059
Paper2024RabarisonPazukiMolin2024

Exponentielle tronquée et autres contes galoisiens

Rabarison, Patrick and Pazuki, Fabien and Molin, Pascal. Publications mathématiques de Besançon. Algèbre et théorie des nombres, 105–117, 2024.

Surveys exponential truncations and gives explicit investigations of Padé approximants, relating Schur’s classical results to later computational questions.

Status and links

Status: Published · checked 2026-11-11

Cited in: Taylor polynomials

060
PaperUndatedKatzRivinSpeculations

Speculations in Galois Theory

Katz, Nicholas M. and Rivin, Igor. Laumon volume (online contribution).

Poses limiting-frequency questions for Galois groups of Taylor truncations and reports computations in many families. The article explicitly separates experimental evidence from theorems; its posted copy has no date on the title page.

Status and links

Status: Peer-reviewed online contribution to the Laumon volume; collected book forthcoming; publication year not verified · checked 2026-11-12

Cited in: Taylor polynomials · Taylor polynomials and Katz–Rivin questions

062
Paper2002FilasetaLam2002

On the irreducibility of the generalized Laguerre polynomials

Filaseta, Michael and Lam, Tsit-Yuen. Acta Arithmetica, 105(2), 177–182, 2002.

For each fixed rational parameter outside the negative integers, proves irreducibility over Q in every sufficiently large degree. The threshold depends on the parameter, so this is not a uniform theorem when the parameter varies with degree.

Status and links

Status: Published · checked 2026-11-11

Cited in: Generalized Laguerre polynomials

063
Paper2002FilasetaTrifonov2002

The irreducibility of the Bessel polynomials

Filaseta, Michael and Trifonov, Ognian. Journal für die reine und angewandte Mathematik, 550, 125–140, 2002.

Resolves Grosswald’s irreducibility conjecture for Bessel polynomials in every positive degree. Proves a stronger coefficient-perturbation statement using Newton polygons and prime-divisor estimates.

Status and links

Status: Published · checked 2026-11-11

Cited in: Hermite, Bessel, and Legendre polynomials · Laguerre polynomials with negative parameters

064
Paper2005Hajir2005

On the Galois group of generalized Laguerre polynomials

Hajir, Farshid. Journal de théorie des nombres de Bordeaux, 17(2), 517–525, 2005.

Introduces a Newton-index criterion for containing A_n and applies it, together with irreducibility results, to generalized Laguerre polynomials with fixed rational parameter outside the negative integers in sufficiently large degree. Irreducibility is an explicit input to the group criterion.

Status and links

Status: Published · checked 2026-11-11

Cited in: Foundations: polynomials, fields, and Galois groups · Reduction modulo primes · Schönemann–Eisenstein and Dumas criteria · Newton polygons and Galois groups · Generalized Laguerre polynomials

065
Paper2009Hajir2009

Algebraic properties of a family of generalized Laguerre polynomials

Hajir, Farshid. Canadian Journal of Mathematics, 61(3), 583–603, 2009.

Studies negative integral parameters linked to degree, a regime different from the fixed-parameter theorem. Newton polygons organize irreducibility and large-group results, together with precise remaining conjectures.

Status and links

Status: Published · checked 2026-11-11

Cited in: Generalized Laguerre polynomials · Laguerre polynomials with negative parameters

066
Paper2012FilasetaKiddTrifonov2012

Laguerre polynomials with Galois group A_m for each m

Filaseta, Michael and Kidd, Travis and Trifonov, Ognian. Journal of Number Theory, 132, 776–805, 2012.

Completes Schur's generalized Laguerre realizations of A_m by treating m congruent to 2 modulo 4. The constructed polynomials are irreducible for m > 2, while m = 2 is the split case.

Status and links

Status: Published · checked 2026-11-12

Cited in: Generalized Laguerre polynomials

067
Paper2013BanerjeeFilasetaFinchLeidy2013

On classifying Laguerre polynomials which have Galois group the alternating group

Banerjee, Pradipto and Filaseta, Michael and Finch, Carrie E. and Leidy, J. Russell. Journal de théorie des nombres de Bordeaux, 25(1), 1–30, 2013.

Classifies the integer parameter pairs with nonzero square discriminant into explicit infinite families and a finite remainder. A square discriminant constrains the group to A_n but does not by itself prove irreducibility or equality with A_n.

Status and links

Status: Published · checked 2026-11-11

Cited in: Generalized Laguerre polynomials

068
Paper2022JindalLaishram2022

Families of Laguerre polynomials with alternating group as Galois group

Jindal, Ankita and Laishram, Shanta. Journal of Number Theory, 241, 387–429, 2022.

Proves irreducibility and group results for integer parameters in the interval [-2n-4,-2n], including Bessel-related cases. Verifies parts of the alternating-group conjectural classification in that range.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

069
Paper2009CullinanHajirSell2009

Algebraic properties of a family of Jacobi polynomials

Cullinan, John and Hajir, Farshid and Sell, Elizabeth. Journal de théorie des nombres de Bordeaux, 21(1), 97–108, 2009.

For fixed n at least 6, obtains irreducibility for all but finitely many rational parameters in a particular one-parameter Jacobi subfamily. The Galois-group exceptional set is finite for odd n and thin for even n.

Status and links

Status: Published · checked 2026-11-11

Cited in: Reciprocal polynomials · Hermite, Bessel, and Legendre polynomials

070
Paper2014CullinanHajir2014

On the Galois groups of Legendre polynomials

Cullinan, John and Hajir, Farshid. Indagationes Mathematicae, 25(3), 534–552, 2014.

Studies the groups of parity-reduced Legendre polynomials through discriminants and Newton polygons. Its results and conjectures must be stated for the correct reduced polynomial, with irreducibility assumptions where required.

Status and links

Status: Published · checked 2026-11-11

Primary author PDF checked for Conjecture 1.5 and Theorem 1.9. The Numdam pmb.57 link is a later survey citing this paper, not its original full text.

Cited in: Reciprocal polynomials · Hermite, Bessel, and Legendre polynomials

071
Paper2017CullinanHajir2017

Algebraic properties of Kaneko-Zagier lifts of supersingular polynomials

Cullinan, John and Hajir, Farshid. Proceedings of the American Mathematical Society, 145(6), 2291–2304, 2017.

Connects rational lifts of supersingular polynomials with specialized Jacobi polynomials. Gives new irreducibility cases and investigates the Mahlburg–Ono maximal-Galois-group conjecture after removing trivial factors.

Status and links

Status: Published · checked 2026-11-11

Cited in: Kaneko–Zagier polynomials

073
Paper1952Carlitz1952BernoulliEuler

Note on irreducibility of the Bernoulli and Euler polynomials

Carlitz, Leonard. Duke Mathematical Journal, 19, 475–481, 1952.

An early arithmetic source for irreducibility in Bernoulli and Euler families. These are the Appell polynomials defined by exponential generating functions, and should not be conflated with descent-enumerating Eulerian polynomials.

Status and links

Status: Published · checked 2026-11-11

Cited in: Bernoulli and Euler polynomials

074
Paper1969Brillhart1969

On the Euler and Bernoulli polynomials

Brillhart, John. Journal für die reine und angewandte Mathematik, 234, 45–64, 1969.

Studies factorization and roots of Euler and Bernoulli polynomials, including irreducibility results and normalizations after removing forced factors.

Status and links

Status: Published · checked 2026-11-11

Cited in: Bernoulli and Euler polynomials

075
Book1970FoataSchutzenberger1970

Théorie géométrique des polynômes eulériens

Foata, Dominique and Schützenberger, Marcel-Paul. Springer, Lecture Notes in Mathematics, vol. 138, 1970.

Develops the conventions, generating functions, and symmetries of Eulerian polynomials used in their arithmetic study.

Status and links

Status: Published · checked 2026-11-12

The linked December 2005 TeX retypesetting is authorized; it reproduces the 1970 monograph with different pagination.

Cited in: Reciprocal polynomials · Eulerian polynomials

076
Paper1974SharmaStraus1974

On the irreducibility of a class of Euler Frobenius polynomials

Sharma, A. and Straus, Ernst G. Canadian Mathematical Bulletin, 17(2), 265–273, 1974.

Proves irreducibility results for Euler–Frobenius polynomials. Theorem 6 at parameter r=1 includes the classical Eulerian polynomial at an odd prime index, where a shift gives Eisenstein’s criterion.

Status and links

Status: Published · checked 2026-11-11

Cited in: Eulerian polynomials

077
Paper2023MinacNguyenTan2023

Fekete polynomials, quadratic residues, and arithmetic

Mináč, Ján and Nguyen, Tung T. and Tân, Nguyen Duy. Journal of Number Theory, 242, 532–575, 2023.

Introduces normalized reciprocal and trace polynomials associated with prime-conductor Fekete polynomials, relates values to class numbers, and studies their splitting fields. The proposed full wreath-product group is a conjecture in this source, not an all-prime theorem.

Status and links

Status: Published · checked 2026-11-12

Cited in: Reciprocal polynomials · Fekete polynomials

078
Paper2024MinacNguyenTan2024

On the arithmetic of generalized Fekete polynomials

Mináč, Ján and Nguyen, Tung T. and Tân, Nguyen Duy. Experimental Mathematics, 33(4), 723–754, 2024.

Extends the arithmetic investigation to quadratic characters with possibly composite conductor. Cyclotomic factors, trace-polynomial reductions, and extra symmetries constrain the possible Galois groups.

Status and links

Status: Published · checked 2026-11-12

Cited in: Fekete polynomials

079
Paper2026AndersonBertelliODorney2026

Galois groups of reciprocal polynomials and the van der Waerden-Bhargava theorem

Anderson, Theresa C. and Bertelli, Adam and O'Dorney, Evan M. Algebra & Number Theory, 20(3), 603–628, 2026.

For separable reciprocal polynomials of degree 2n and growing coefficient height H, gives exceptional proportion of order H^(-1) log H for nonmonic n ≥ 1 and monic n ≥ 3. The corrected version leaves the monic quartic case open; the expected group is the full signed-permutation group.

Status and links

Status: Published · checked 2026-11-12

Cited in: Reciprocal polynomials · Eulerian polynomials · Height bounds for exceptional Galois groups · Random reciprocal polynomials of growing degree · Twisted reciprocity and square discriminants

080
Paper1936vanderWaerden1936

Die Seltenheit der reduziblen Gleichungen und der Gleichungen mit Affekt

van der Waerden, B. L. Monatshefte für Mathematik und Physik, 43, 133–147, 1936.

Studies the rarity of reducible polynomials and exceptional Galois groups in coefficient boxes as coefficient height grows with degree fixed.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

081
Paper1963Chela1963

Reducible polynomials

Chela, R. Journal of the London Mathematical Society, 38(1), 183–188, 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.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

082
Paper1973Gallagher1973

The large sieve and probabilistic Galois theory

Gallagher, P. X. Analytic Number Theory, American Mathematical Society, Proceedings of Symposia in Pure Mathematics, 24, 91–101, 1973.

Uses the large sieve to combine factorization information at many primes and bound exceptional Galois groups in fixed-degree integer coefficient boxes.

Status and links

Status: Published · checked 2026-11-11

Cited in: Height bounds for exceptional Galois groups

083
Paper2012Dietmann2012

On the distribution of Galois groups

Dietmann, Rainer. Mathematika, 58(1), 35–44, 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.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

084
Paper2020ChowDietmann2020

Enumerative Galois theory for cubics and quartics

Chow, Sam and Dietmann, Rainer. Advances in Mathematics, 372, Article 107282, 2020.

Studies counts for individual Galois groups in degrees three and four, refining the question of how often the full symmetric group occurs.

Status and links

Status: Published · checked 2026-11-11

Cited in: Height bounds for exceptional Galois groups

085
Paper2024BarySorokerBenPorathMatei2024

Probabilistic Galois Theory: The square discriminant case

Bary-Soroker, Lior and Ben-Porath, Or and Matei, Vlad. Bulletin of the London Mathematical Society, 56(6), 2162–2177, 2024.

Studies the frequency of alternating Galois groups and nonzero square discriminants in the fixed-degree large-box model. Constructions and lower bounds show why a naive random-integer model for the discriminant can be misleading.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

086
Paper2025Bhargava2025

Galois groups of random integer polynomials and van der Waerden’s Conjecture

Bhargava, Manjul. Annals of Mathematics, 201(2), 339–377, 2025.

Proves the order-of-magnitude bound O(H^(n-1)) for monic integer polynomials of each fixed degree n ≥ 3 and height at most H whose Galois group is not S_n. Degree is fixed; this does not settle the fixed-coefficient-law, growing-degree problem.

Status and links

Status: Published · checked 2026-11-12

Cited in: Height bounds for exceptional Galois groups · Random polynomials: models and methods

087
Paper1993OdlyzkoPoonen1993

Zeros of polynomials with 0,1 coefficients

Odlyzko, A. M. and Poonen, Bjorn. L’Enseignement Mathématique, 39(3--4), 317–348, 1993.

Poses the asymptotic irreducibility question for monic 0–1 polynomials with constant coefficient 1. Its principal results concern the geometry and topology of their zero sets.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

088
Paper1999Konyagin1999

On the number of irreducible polynomials with 0,1 coefficients

Konyagin, S. V. Acta Arithmetica, 88(4), 333–350, 1999.

For the 0–1 model, unconditionally excludes small-degree factors with high probability and obtains a lower bound of order 1/log n for irreducibility, using finite-field and exponential-sum methods.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

089
Paper2017BarySorokerKozma2017Bivariate

Is a bivariate polynomial with ±1 coefficients irreducible? Very likely!

Bary-Soroker, Lior and Kozma, Gady. International Journal of Number Theory, 13(4), 933–936, 2017.

Studies irreducibility of random bivariate sign polynomials. The additional variable permits arguments unavailable in the univariate fixed-coefficient model.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

090
Paper2018BorstEtAl2018

Irreducibility of random polynomials

Borst, Christian and Boyd, Evan and Brekken, Claire and Solberg, Samantha and Wood, Melanie Matchett and Wood, Philip Matchett. Experimental Mathematics, 27(4), 498–506, 2018.

Computational study of several sampling models and a universality heuristic relating reducibility to low-degree factors. Treat its numerical evidence and conjectures separately from its rigorous statements.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

091
Paper2019BreuillardVarju2019

Irreducibility of random polynomials of large degree

Breuillard, Emmanuel and Varjú, Péter P. Acta Mathematica, 223(2), 195–249, 2019.

Under Riemann hypotheses for suitable Dedekind zeta functions, proves irreducibility and alternating-group containment for broad independent-coefficient models, with careful treatment of zero and cyclotomic factors. The method connects finite-field random walks, root counts and effective prime-ideal estimates.

Status and links

Status: Published; main general results conditional on RH · checked 2026-11-11

Cited in: Random polynomials: models and methods · Littlewood polynomials · Factor reversal for random binary polynomials

092
Paper2019ORourkeWood2019

Low-degree factors of random polynomials

O’Rourke, Sean and Wood, Philip Matchett. Journal of Theoretical Probability, 32(2), 1076–1104, 2019.

Converts pointwise delocalization of roots into exclusion of factors of low algebraic degree. Covers several random-matrix characteristic-polynomial models as well as random polynomials; absence of low-degree factors alone is weaker than irreducibility.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

093
Paper2020BarySorokerKozma2020

Irreducible polynomials of bounded height

Bary-Soroker, Lior and Kozma, Gady. Duke Mathematical Journal, 169(4), 579–598, 2020.

Proves high-probability irreducibility and containment of A_n for suitable fixed coefficient distributions, including uniform coefficients in {1,...,210}. Combines reductions at several primes with probabilistic permutation-group arguments.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

094
Paper2023BarySorokerKoukoulopoulosKozma2023

Irreducibility of random polynomials: general measures

Bary-Soroker, Lior and Koukoulopoulos, Dimitris and Kozma, Gady. Inventiones Mathematicae, 233(3), 1041–1120, 2023.

Develops Fourier equidistribution, a sieve for factor degrees and permutation-group methods for independent integer coefficients, conditioning on nonzero constant term. Proves high-probability irreducibility and Galois group A_n or S_n under explicit distributional hypotheses, including a uniform interval of at least 35 integers; much more general laws yield exclusion of factors up to a positive fraction of the degree.

Status and links

Status: Published · checked 2026-11-11

Cited in: Random polynomials: models and methods

095
Paper2025BarySorokerGoldgraber2025

Full Galois groups of polynomials with slowly growing coefficients

Bary-Soroker, Lior and Goldgraber, Noam. Bulletin of the London Mathematical Society, 57(3), 941–955, 2025.

For monic degree-n polynomials with coefficients uniform in [-L(n),L(n)], proves full symmetric Galois group with high probability whenever L(n) tends to infinity. The interval may grow arbitrarily slowly; the theorem does not assert the same conclusion for a fixed interval.

Status and links

Status: Published · checked 2026-11-11

Cited in: Random polynomials: models and methods

096
Paper2025BarySorokerHokkenKozmaPoonen2025

Irreducibility of Littlewood polynomials of special degrees

Bary-Soroker, Lior and Hokken, David and Kozma, Gady and Poonen, Bjorn. International Mathematics Research Notices, 2025(21), rnaf326, 2025.

Proves unconditionally that the limsup of the irreducibility probability for uniformly random Littlewood polynomials is 1, using factorization constraints in special degrees. This does not establish an all-degree limit.

Status and links

Status: Published · checked 2026-11-11

Cited in: Random polynomials: models and methods · Littlewood polynomials

097
Paper2025Bazin2025

Irreducibility of random polynomials of ℤ[X]

Bazin, Pierre-Alexandre. International Mathematics Research Notices, 2025(11), rnaf136, 2025.

Improves rates in the Bary-Soroker–Koukoulopoulos–Kozma framework when near-uniformity holds modulo more primes. The zero-constant-term obstruction remains: for example, uniform intervals of length at least 10^8 give P(reducible) ≤ P(a_0=0)+O(n^(-1/2)), rather than an unconditioned bound tending to zero.

Status and links

Status: Published · checked 2026-11-12

Cited in: Random polynomials: models and methods

098
Preprint2025HokkenKoukoulopoulos2025

Irreducibility and Galois groups of random reciprocal polynomials of large degree

Hokken, David and Koukoulopoulos, Dimitris. 2025.

For reciprocal polynomials of degree 2m and coefficient laws satisfying a Fourier hypothesis, proves high-probability irreducibility and a Galois group equal to the hyperoctahedral group or one of two index-two subgroups. The paired-root symmetry changes both the natural ambient group and the factorization arguments.

Status and links

Status: Preprint; version 2 dated 23 September 2026 · checked 2026-11-11

Version 2, 23 September 2026

Cited in: Random polynomials: models and methods · Random reciprocal polynomials of growing degree

099
Preprint2026BlacharBreuillardKozma2026

Galois groups of random polynomials of large degree

Blachar, Guy and Breuillard, Emmanuel and Kozma, Gady. 2026.

Preprint reporting an O(1/log n) square-discriminant probability bound in a high-entropy bounded-coefficient model (Rényi entropy of order 2 greater than 12). The atlas reports the constant-term-one subclass and the uniform-interval full-S_n corollary conditioned on a nonzero constant term. The unqualified v1 statement permits a zero constant term and misses the persistent discriminant-zero event when the first two coefficients vanish; the full proof has not been independently verified.

Status and links

Status: Preprint; version 1 dated 30 September 2026; scope issue noted · checked 2026-11-11

Version 1, 30 September 2026

Theorem 1.1 in v1 includes square discriminant without excluding zero and permits an arbitrary independent bounded constant-term law. If the constant and linear coefficients are iid with law μ and μ(0)>0, discriminant zero has probability at least μ(0)^2, contradicting the unrestricted bound. Section 8 invokes an O(1/n) repeated-root bound without removing this event. The website records only the a0=1 reported subclass and the explicitly conditioned interval corollary; it does not certify or repair the preprint proof.

Cited in: Random polynomials: models and methods

100
Preprint2026Kogler2026

The Odlyzko-Poonen Conjecture on Irreducibility of Random Polynomials

Kogler, Constantin. 2026.

Preprint presenting an unconditional proof of the irreducibility limit for monic polynomials with constant coefficient 1 and all remaining coefficients independent uniform in {0,1}. The claim concerns this coefficient model and remains a preprint result.

Status and links

Status: Preprint; version 2 dated 14 October 2026 · checked 2026-11-11

Version 2, 14 October 2026

Cited in: Random polynomials: models and methods · Littlewood polynomials · Factor reversal for random binary polynomials

101
Paper2026VarjuXu2026

A random polynomial with multiplicative coefficients is almost surely irreducible

Varjú, Péter P. and Xu, Max Wenqiang. International Mathematics Research Notices, 2026(16), rnag178, 2026.

Under RH for Dedekind zeta functions, proves irreducibility with probability 1-O(d^(-1/2+epsilon)) for specified random multiplicative-coefficient models. The theorem concerns P_d(x)/x, after removal of the obligatory factor x; these coefficients are dependent.

Status and links

Status: Published; conditional on RH · checked 2026-11-12

Cited in: Fekete polynomials · Random polynomials: models and methods

102
Paper2008Rivin2008

Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms

Rivin, Igor. Duke Mathematical Journal, 142(2), 353–379, 2008.

Relates random walks on arithmetic groups and finite quotients to irreducible characteristic polynomials. Its random-walk and height models differ from models with independent bounded matrix entries.

Status and links

Status: Published · checked 2026-11-11

Cited in: Characteristic polynomials of random matrices

103
Paper2022Eberhard2022

The characteristic polynomial of a random matrix

Eberhard, Sean. Combinatorica, 42(4), 491–527, 2022.

Proves high-probability irreducibility and containment of A_n for matrices with independent entries from a fixed nonconstant finitely supported integer law, assuming ERH. Theorem 1.2 proves the same conclusion unconditionally when the law is uniform modulo a product of four distinct primes. The characteristic coefficients are dependent, so the argument uses finite-field matrix estimates.

Status and links

Status: Published; general theorem conditional on ERH; unconditional four-prime case · checked 2026-11-12

Cited in: Characteristic polynomials of random matrices

104
Paper2023FerberJainSahSawhney2023

Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial

Ferber, Asaf and Jain, Vishesh and Sah, Ashwin and Sawhney, Mehtaab. Mathematical Proceedings of the Cambridge Philosophical Society, 174(2), 233–246, 2023.

Under ERH, proves high-probability irreducibility for characteristic polynomials of random symmetric sign matrices, using sharp finite-field rank-distribution estimates and inverse Littlewood-Offord methods.

Status and links

Status: Published; irreducibility application conditional on ERH · checked 2026-11-11

Cited in: Characteristic polynomials of random matrices

105
Paper2026AndersonODorney2026Matrices

Galois groups of random integer matrices

Anderson, Theresa C. and O’Dorney, Evan M. Mathematical Proceedings of the Cambridge Philosophical Society, 1–16, 2026.

Studies fixed-size integer matrices with entries bounded by a height parameter and counts characteristic polynomials with non-symmetric Galois group. Uses the large sieve, Fourier analysis and geometric sieving; this is a different asymptotic regime from Eberhard’s growing-dimension theorem.

Status and links

Status: Published online 12 August 2026; First View · checked 2026-11-11

Cited in: Characteristic polynomials of random matrices

106
Paper2026BarySorokerGarzoniSodin2026

Irreducibility of the characteristic polynomials of random tridiagonal matrices

Bary-Soroker, Lior and Garzoni, Daniele and Sodin, Sasha. Journal of Number Theory, 280, 973–998, 2026.

Under RH for certain Dedekind zeta functions, proves irreducibility with exponentially high probability and alternating-or-symmetric Galois group for a specified tridiagonal model. A related model has a smaller Galois group.

Status and links

Status: Published; conditional on RH · checked 2026-11-11

Cited in: Characteristic polynomials of random matrices

107
Paper1993LuczakPyber1993

On random generation of the symmetric group

Łuczak, Tomasz and Pyber, László. Combinatorics, Probability and Computing, 2(4), 505–512, 1993.

Supplies the permutation-group principle behind several probabilistic Galois arguments: a random permutation rarely belongs to a proper transitive subgroup other than A_n. Invariable generation is relevant because modular factorization determines conjugacy classes, rather than labeled permutations.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

108
Paper2016EberhardFordKoukoulopoulos2016

Permutations contained in transitive subgroups

Eberhard, Sean and Ford, Kevin and Koukoulopoulos, Dimitris. Discrete Analysis, 2016, Article 12, 2016.

Sharpens quantitative bounds for permutations lying in transitive subgroups other than S_n or A_n. It treats imprimitive and primitive obstructions separately, supplying estimates for large-group arguments after irreducibility has been established.

Status and links

Status: Published · checked 2026-11-11

Paper No. 12

Cited in: Not cited in an article.

109
Paper2017EberhardFordGreen2017

Invariable generation of the symmetric group

Eberhard, Sean and Ford, Kevin and Green, Ben. Duke Mathematical Journal, 166(8), 1573–1590, 2017.

Shows that three uniform random permutations fail to invariably generate S_n with probability tending to one, whereas four succeed with probability bounded away from zero. Explains why information from a small fixed collection of modular factorizations has a nontrivial combinatorial threshold.

Status and links

Status: Published · checked 2026-11-11

Cited in: Not cited in an article.

110
Paper1892Hilbert1892

Ueber die Irreducibilität ganzer rationaler Functionen mit ganzzahligen Coefficienten

Hilbert, David. Journal für die reine und angewandte Mathematik, 110, 104–129, 1892.

The original source for Hilbert's irreducibility theorem. It is the historical starting point for passing from irreducible polynomial families over a rational function field to irreducible arithmetic specializations; use a modern treatment for the general language of Hilbertian fields.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Specialization and Hilbert irreducibility

111
Paper1994DvornicichZannier1994

Fields containing values of algebraic functions

Dvornicich, Roberto and Zannier, Umberto. Annali della Scuola Normale Superiore di Pisa, Classe di Scienze (4), 21(3), 421–443, 1994.

Studies the number fields generated by specialized values of algebraic functions, addressing the diversity of fields obtained from irreducible specializations.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

112
Paper2006HajirWong2006

Specializations of one-parameter families of polynomials

Hajir, Farshid and Wong, Siman. Annales de l’Institut Fourier, 56(4), 1127–1163, 2006.

Develops geometric and group-theoretic conditions that make the exceptional set of reducible specializations over a number field finite. For fixed n ≥ 10, all but finitely many parameter values in any fixed number field give irreducible generalized Laguerre polynomials with Galois group S_n.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Generalized Laguerre polynomials · Hermite, Bessel, and Legendre polynomials · Specialization and Hilbert irreducibility · Exceptional specializations

113
Paper2007DvornicichZannier2007

Cyclotomic Diophantine problems (Hilbert irreducibility and invariant sets for polynomial maps)

Dvornicich, Roberto and Zannier, Umberto. Duke Mathematical Journal, 139(3), 527–554, 2007.

Develops Hilbert irreducibility in cyclotomic extensions through the arithmetic of torsion points on tori. Applications to roots-of-unity parameters or dynamics over cyclotomic fields require the stated structural hypotheses.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

114
Book2007Serre2007Topics

Topics in Galois Theory

Serre, Jean-Pierre. Edition 2. A K Peters/CRC Press, Research Notes in Mathematics 1, 2007.

Treats Hilbert irreducibility, thin sets, explicit Galois realizations, rigidity, and sieve methods. Chapter 3 and Section 4.6 explain preservation of generic Galois groups under specialization. Section 4.4 proves the Morse criterion using inertia and Riemann–Hurwitz to obtain full symmetric monodromy.

Status and links

Status: Published monograph · checked 2026-11-12

Notes written by Henri Darmon. Publisher electronic edition copyright 2007; the physical second edition is also commonly catalogued and cited as 2008.

Cited in: Foundations: polynomials, fields, and Galois groups · Specialization and Hilbert irreducibility · Exceptional specializations · Critical points and polynomial monodromy · Branched covers and rigidity · Inverse Galois theory and generic polynomials

115
Paper2010Zannier2010

Hilbert irreducibility above algebraic groups

Zannier, Umberto. Duke Mathematical Journal, 153(2), 397–425, 2010.

Studies irreducible fibers above Zariski-dense cyclic subgroups of algebraic tori and powers of an elliptic curve without complex multiplication, under a pullback irreducibility condition. The method combines torsion specialization with descent using Chebotarev, and yields a Bertini-type result for tori.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

116
Paper2013DebesLegrand2013

Specialization results in Galois theory

Dèbes, Pierre and Legrand, François. Transactions of the American Mathematical Society, 365(10), 5259–5275, 2013.

Uses twisting to turn prescribed specialization questions into rational-point questions. One application combines irreducible specialization with prescribed residue-degree partitions at finitely many sufficiently large primes for covers over Q with geometric monodromy S_n.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

117
Book2023FriedJarden2023

Field Arithmetic

Fried, Michael D. and Jarden, Moshe. Edition 4. Springer, Ergebnisse der Mathematik und ihrer Grenzgebiete, 3. Folge, 11, 2023.

Treats Hilbertian fields, absolute Galois groups, specialization, and PAC fields. The fourth edition updates the earlier editions and adds a chapter on Hilbertian subfields of Galois extensions.

Status and links

Status: Published monograph · checked 2026-11-11

Cited in: Specialization and Hilbert irreducibility

118
Book1996Volklein1996

Groups as Galois Groups: An Introduction

Völklein, Helmut. Cambridge Studies in Advanced Mathematics 53, Cambridge University Press, 1996.

Develops the geometric approach to inverse Galois theory through covers, Riemann’s existence theorem, and rigidity, constructing polynomial families from prescribed permutation data.

Status and links

Status: Published monograph · checked 2026-11-11

Cited in: Not cited in an article.

119
Book2002JensenLedetYui2002

Generic Polynomials: Constructive Aspects of the Inverse Galois Problem

Jensen, Christian U. and Ledet, Arne and Yui, Noriko. Mathematical Sciences Research Institute Publications 45, Cambridge University Press, 2002.

Constructs generic polynomials using invariant-theoretic methods. The MSRI/SLMath page provides free downloadable chapters and explicit families for specified finite groups.

Status and links

Status: Published monograph · checked 2026-11-11

Cited in: Specialization and Hilbert irreducibility · Generic polynomials and invariant fields · Inverse Galois theory and generic polynomials

120
Book2018MalleMatzat2018

Inverse Galois Theory

Malle, Gunter and Matzat, B. Heinrich. Edition 2. Springer Monographs in Mathematics, 2018.

A systematic reference for constructing Galois extensions through rigidity, braid actions, embedding problems, additive polynomials, and rigid analytic methods. It also includes tables of example polynomials for transitive and primitive groups of small degree.

Status and links

Status: Published monograph · checked 2026-11-11

Cited in: Branched covers and rigidity · Inverse Galois theory and generic polynomials

121
Paper1985Odoni1985

The Galois Theory of Iterates and Composites of Polynomials

Odoni, R. W. K. Proceedings of the London Mathematical Society (3), 51(3), 385–414, 1985.

Studies Galois groups under composition and iteration. In characteristic zero, the iterates of the generic degree-d polynomial have the full iterated wreath-product group, giving finite-level specialization results and motivating arboreal questions.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Composition and iteration · Polynomial decomposition · Arboreal Galois groups

122
Paper1992Stoll1992

Galois groups over Q of some iterated polynomials

Stoll, Michael. Archiv der Mathematik, 59, 239–244, 1992.

Characterizes maximality of iterated quadratic Galois groups through arithmetic square-class conditions, relating critical orbits to the growth of splitting fields.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Composition and iteration · Arboreal Galois groups

123
Paper2000AyadMcQuillan2000

Irreducibility of the iterates of a quadratic polynomial over a field

Ayad, Mohamed and McQuillan, Donald L. Acta Arithmetica, 93(1), 87–97, 2000.

Develops criteria for irreducibility of successive quadratic iterates. Read it together with the authors' 2001 correction before using the stated tests in a proof or computation.

Status and links

Status: Published article; correction available · checked 2026-11-11

Cited in: The Galois correspondence and intermediate fields · Capelli’s theorem and polynomial composition

124
Paper2001AyadMcQuillan2001Correction

Corrections to "Irreducibility of the iterates of a quadratic polynomial over a field" (Acta Arith. 93 (2000), 87--97)

Ayad, Mohamed and McQuillan, Donald L. Acta Arithmetica, 99(1), 97, 2001.

Corrects Ayad and McQuillan’s quadratic-iteration paper and should be read with the original article.

Status and links

Status: Published correction · checked 2026-11-11

Cited in: Capelli’s theorem and polynomial composition

125
Paper2012Jones2012EveryPrime

An iterative construction of irreducible polynomials reducible modulo every prime

Jones, Rafe. Journal of Algebra, 369, 114–128, 2012.

Constructs polynomials of arbitrarily large degree that are irreducible over Q, and over suitable other global fields, but reducible modulo every prime. Failure to find an irreducible reduction is therefore not evidence of reducibility over the ground field.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Irreducibility of iterates

126
Paper2013Jones2013Arboreal

Galois representations from pre-image trees: an arboreal survey

Jones, Rafe. Publications mathématiques de Besançon. Algèbre et théorie des nombres, 107–136, 2013.

Surveys Galois actions on trees of iterated preimages, stability, and density questions. Its bibliography covers the foundational literature; its open-problem discussion predates subsequent results.

Status and links

Status: Published survey · checked 2026-11-11

Cited in: The Galois correspondence and intermediate fields · Capelli’s theorem and polynomial composition · Composition and iteration · Irreducibility of iterates · Arboreal Galois groups

127
Preprint2018Specter2018

Polynomials with Surjective Arboreal Galois Representations Exist in Every Degree

Specter, Joel. arXiv preprint, 2018.

Gives the number-field form of Odoni's existence conjecture in all degrees. The source checked is the 2018 preprint, cited as such in subsequent literature; this must be distinguished from the false assertion over all Hilbertian fields.

Status and links

Status: Preprint; version 2, 12 March 2018 · checked 2026-11-11

Cited in: Composition and iteration · Arboreal Galois groups

128
Paper2019BenedettoJuul2019

Odoni's conjecture for number fields

Benedetto, Robert L. and Juul, Jamie. Bulletin of the London Mathematical Society, 51(2), 237–250, 2019.

Proves existence of full arboreal Galois groups over a number field K for degree d≥2 when d is even, or when d and d−2 are not both squares in K. The odd-degree-extension case is a useful corollary, not the full scope. The constructed polynomial may have non-integral coefficients.

Status and links

Status: Published article · checked 2026-11-12

Exact scope checked in Theorem 1.1 of the author manuscript, corresponding to Theorem 1.2 in arXiv:1803.01987v1.

Cited in: Composition and iteration · Arboreal Galois groups

129
Paper2019Juul2019

Iterates of Generic Polynomials and Generic Rational Functions

Juul, Jamie. Transactions of the American Mathematical Society, 371(2), 809–831, 2019.

Extends the generic full wreath-product result to arbitrary characteristic for rational functions and to polynomials except the degree-2, characteristic-2 case. The paper also records the contributions of Odoni's unpublished work to these results.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Arboreal Galois groups

130
Paper2019Looper2019

Dynamical Galois groups of trinomials and Odoni's conjecture

Looper, Nicole R. Bulletin of the London Mathematical Society, 51(2), 278–292, 2019.

Constructs integral polynomials with surjective arboreal representations in every prime degree. It also gives conditional results in certain composite degrees using Vojta's conjecture, so the unconditional and conditional statements should be separated.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Composition and iteration · Arboreal Galois groups

131
Paper2022DittmannKadets2022

Odoni's conjecture on arboreal Galois representations is false

Dittmann, Philip and Kadets, Borys. Proceedings of the American Mathematical Society, 150(8), 3335–3343, 2022.

Disproves Odoni’s conjecture over general Hilbertian fields of characteristic zero. The counterexamples do not contradict positive existence results over number fields.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Specialization and Hilbert irreducibility · Composition and iteration

132
Paper1922Ritt1922

Prime and composite polynomials

Ritt, Joseph F. Transactions of the American Mathematical Society, 23(1), 51–66, 1922.

The classical source for functional decomposition of complex polynomials into indecomposable components. Here prime means indecomposable under composition, not irreducible under multiplication; read together with the erratum in the same volume, p. 431.

Status and links

Status: Published article with erratum · checked 2026-11-11

Cited in: Composition and iteration · Polynomial decomposition

133
Paper1995Mueller1995Monodromy

Primitive monodromy groups of polynomials

Müller, Peter. Recent Developments in the Inverse Galois Problem, American Mathematical Society, Contemporary Mathematics, 186, 385–401, 1995.

Classifies geometric monodromy groups of indecomposable complex polynomials and discusses restrictions for polynomials with rational coefficients. The group is that of f(X)−t over a function field, rather than the splitting-field group of f(X) over the coefficient field.

Status and links

Status: Published book chapter; author-hosted version · checked 2026-11-11

Cited in: Polynomial decomposition

134
Preprint2008ZieveMueller2008

On Ritt's polynomial decomposition theorems

Zieve, Michael E. and Müller, Peter. arXiv preprint, 2008.

Describes all complete decompositions of a complex polynomial, refining Ritt’s theory. Both authors’ publication pages list the work as a preprint; no journal publication is asserted here.

Status and links

Status: Preprint; no journal publication verified · checked 2026-11-11

Cited in: Polynomial decomposition

135
Paper2011MuzychukPakovich2011

Jordan–Hölder theorem for imprimitivity systems and maximal decompositions of rational functions

Muzychuk, Mikhail and Pakovich, Fedor. Proceedings of the London Mathematical Society, 102(1), 1–24, 2011.

Studies imprimitivity lattices for permutation groups with a cyclic subgroup having at most two orbits, with applications to decomposition. It extends aspects of Ritt's first theorem and explains why unrestricted rational-function analogues can fail.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

136
Paper1990Shoup1990Irreducible

New algorithms for finding irreducible polynomials over finite fields

Shoup, Victor. Mathematics of Computation, 54, 435–447, 1990.

Constructs irreducible polynomials of a prescribed degree, including deterministic polynomial-time results for small characteristic. Distinguish dependence polynomial in the characteristic from dependence polynomial in its bit length.

Status and links

Status: Published article; author-hosted version · checked 2026-11-11

Cited in: Irreducibility over finite fields

137
Paper1992HansenMullen1992

Primitive polynomials over finite fields

Hansen, Tom and Mullen, Gary L. Mathematics of Computation, 59(200), 639–643, 1992.

Provides explicit primitive-polynomial tables and formulates influential existence conjectures with one prescribed coefficient. The primitivity question and the irreducibility question are distinct; a primitive polynomial has a root generating the multiplicative group of the extension field.

Status and links

Status: Published article with supplementary tables · checked 2026-11-11

Cited in: Finite fields and Frobenius · Irreducibility over finite fields

138
Paper1994Shoup1994

Fast construction of irreducible polynomials over finite fields

Shoup, Victor. Journal of Symbolic Computation, 17, 371–391, 1994.

Gives faster algorithms for constructing an irreducible polynomial of specified degree over a finite field, thereby producing an explicit representation of the corresponding extension field.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Irreducibility over finite fields

139
Paper1997Wan1997

Generators and irreducible polynomials over finite fields

Wan, Daqing. Mathematics of Computation, 66(219), 1195–1212, 1997.

Uses character-sum estimates to study generators and irreducible polynomials with prescribed coefficients. Establishes the Hansen–Mullen irreducibility assertion outside finitely many cases; Ham and Mullen settle the remaining cases.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Irreducible polynomials with coefficient restrictions

140
Paper1998HamMullen1998

Distribution of irreducible polynomials of small degrees over finite fields

Ham, Kie H. and Mullen, Gary L. Mathematics of Computation, 67(221), 337–341, 1998.

Completes the Hansen–Mullen irreducibility conjecture by verifying the finite set of cases left by Wan's theorem. The statement includes necessary exceptions, notably a prescribed zero constant coefficient and the quadratic zero-linear-coefficient case in characteristic two.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Irreducible polynomials with coefficient restrictions

141
Paper2006Cohen2006Primitive

Primitive polynomials with a prescribed coefficient

Cohen, Stephen D. Finite Fields and Their Applications, 12(3), 425–491, 2006.

Establishes the Hansen–Mullen primitivity assertion for degrees at least nine by character-sum and sieve methods. This is a stronger condition than irreducibility and this paper alone is not the full treatment of the small-degree cases.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

142
Book2013MullenPanario2013

Handbook of Finite Fields

Mullen, Gary L. and Panario, Daniel (editors). CRC Press, 2013.

Treats irreducible and primitive polynomials, prescribed coefficients, factorization algorithms, and finite-field applications, with an extensive bibliography.

Status and links

Status: Published edited handbook · checked 2026-11-11

Cited in: Finite fields and Frobenius · Irreducibility over finite fields · Sparse irreducible polynomials over finite fields

143
Paper2013Pollack2013Prescribed

Irreducible polynomials with several prescribed coefficients

Pollack, Paul. Finite Fields and Their Applications, 22, 70–78, 2013.

Gives an explicit estimate for monic irreducibles with coefficients prescribed at arbitrary positions, with a nonzero constant term when it is prescribed. For sufficiently large degree n, it allows about (1−ε)√n prescribed coefficients uniformly over the ground finite field.

Status and links

Status: Published article; author-hosted version · checked 2026-11-12

Cited in: Irreducible polynomials with coefficient restrictions

144
Paper2016Ha2016

Irreducible polynomials with several prescribed coefficients

Ha, Junsoo. Finite Fields and Their Applications, 40, 10–25, 2016.

Improves prescribed-coefficient results to a positive proportion of the degree by adapting Bourgain's method. Its large-field range approaches one quarter of the coefficients; the characteristic, size, and nonzero-constant-term conditions must be retained when applying the theorem.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Irreducible polynomials with coefficient restrictions

145
Paper2018TuxanidyWang2018

A new proof of the Hansen–Mullen irreducibility conjecture

Tuxanidy, Aleksandr and Wang, Qiang. Canadian Journal of Mathematics, 70(6), 1373–1389, 2018.

Proves the one-prescribed-coefficient existence theorem using least periods of discrete Fourier transforms over finite fields. This replaces the character-sum approach while retaining the necessary exceptional cases.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Finite fields and Frobenius · Irreducible polynomials with coefficient restrictions

146
Paper1962Swan1962

Factorization of polynomials over finite fields

Swan, Richard G. Pacific Journal of Mathematics, 12(3), 1099–1106, 1962.

Presents the Stickelberger discriminant-parity theorem, including characteristic two via lifting, and derives reducibility obstructions for binary trinomials. Swan explicitly credits the basic parity theorem to Stickelberger and notes Dalen's earlier proof.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Irreducibility over finite fields · Sparse irreducible polynomials over finite fields

147
Paper1970Cohen1970

The distribution of polynomials over finite fields

Cohen, Stephen D. Acta Arithmetica, 17(3), 255–271, 1970.

Studies factorization patterns of f(X)-a g(X) as a varies over a finite field, relating factor degrees to cycle types in a function-field Galois group under the stated arithmetic hypotheses.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Irreducible polynomials with coefficient restrictions · Factorization statistics over finite fields

148
Paper2010GuralnickZieve2010

Polynomials with PSL(2) monodromy

Guralnick, Robert M. and Zieve, Michael E. Annals of Mathematics, 172(2), 1315–1359, 2010.

Classifies positive-characteristic polynomials with specified PSL(2) monodromy under a ramification hypothesis, with applications to exceptional polynomials and decomposition after extending constants. This concerns function-field Galois groups; splitting fields of individual polynomials over finite fields have cyclic Galois groups.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

149
Paper2015BankBarySorokerRosenzweig2015

Prime polynomials in short intervals and in arithmetic progressions

Bank, Efrat and Bary-Soroker, Lior and Rosenzweig, Lior. Duke Mathematical Journal, 164(2), 277–295, 2015.

Proves asymptotic counts for irreducibles in short polynomial intervals and arithmetic progressions, and treats other factorization types. The asymptotic is fixed degree with the field size tending to infinity, with explicit small-characteristic and interval-length restrictions.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Irreducible polynomials with coefficient restrictions · Factorization statistics over finite fields

150
Paper2021Entin2021Restricted

Factorization statistics of restricted polynomial specializations over large finite fields

Entin, Alexei. Israel Journal of Mathematics, 242(1), 37–53, 2021.

Studies factorization patterns when specialization parameters are restricted to sufficiently large, regular subsets of a prime field. The degree stays fixed as the characteristic tends to infinity; the result is not a growing-degree statement over one fixed finite field.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Factorization statistics over finite fields

151
Paper1967Berlekamp1967

Factoring polynomials over finite fields

Berlekamp, Elwyn R. Bell System Technical Journal, 46(8), 1853–1859, 1967.

Factors polynomials over finite fields by linear algebra in the Frobenius-fixed subalgebra, which detects the irreducible factors.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Finite fields and Frobenius · Polynomial factorization algorithms

152
Paper1969Zassenhaus1969

On Hensel factorization, I

Zassenhaus, Hans. Journal of Number Theory, 1(3), 291–311, 1969.

The classical modular route to integer-polynomial factorization: factor modulo a prime, lift p-adically, then recombine the lifted factors. It explains why local factors must be grouped before recovering rational factors.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial factorization algorithms

153
Paper1980Rabin1980

Probabilistic algorithms in finite fields

Rabin, Michael O. SIAM Journal on Computing, 9(2), 273–280, 1980.

Develops finite-field algorithms for irreducible-polynomial construction, root finding, and factorization, alongside Frobenius-power tests for irreducibility of monic polynomials.

Status and links

Status: Published article · checked 2026-11-12

The MIT repository link describes the earlier January 1979 report Probabilistic Algorithm in Finite Fields (MIT-LCS-TR-213). This entry cites the 1980 SIAM journal article; the repository report and journal version have different publication dates.

Cited in: Finite fields and Frobenius · Irreducibility over finite fields · Irreducible polynomials with coefficient restrictions · Polynomial factorization algorithms

154
Paper1981CantorZassenhaus1981

A new algorithm for factoring polynomials over finite fields

Cantor, David G. and Zassenhaus, Hans. Mathematics of Computation, 36(154), 587–592, 1981.

Gives a randomized finite-field factorization algorithm, including the splitting of products whose irreducible factors have equal degree. The search is randomized; the resulting factors can be checked exactly.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Polynomial factorization algorithms

155
Paper1982LLL1982

Factoring polynomials with rational coefficients

Lenstra, A. K. and Lenstra, Jr., H. W. and Lovász, L. Mathematische Annalen, 261(4), 515–534, 1982.

Proves polynomial-time factorization over the rationals using lattice basis reduction. The lattice algorithm also supports algebraic-relation searches and certificate construction.

Status and links

Status: Published article · checked 2026-11-12

The CWI record is the 1982 preprint report IW 195/82; the UC Davis link supplies scanned full text. The Numdam link is the 2009 Belabas–van Hoeij–Klüners–Steel follow-up, not another edition of this 1982 article.

Cited in: Polynomial factorization algorithms

156
Paper1995Shoup1995

A new polynomial factorization algorithm and its implementation

Shoup, Victor. Journal of Symbolic Computation, 20(4), 363–397, 1995.

Develops and implements baby-step/giant-step finite-field factorization, examining its computational performance.

Status and links

Status: Published article · checked 2026-11-12

The open-text link is the author's version. The published article appeared in Journal of Symbolic Computation 20(4), October 1995, pages 363–397.

Cited in: Not cited in an article.

157
Paper1998KaltofenShoup1998

Subquadratic-time factoring of polynomials over finite fields

Kaltofen, Erich and Shoup, Victor. Mathematics of Computation, 67(223), 1179–1197, 1998.

Improves the complexity of randomized polynomial factorization over finite fields through a baby-step/giant-step framework used in later factorization algorithms.

Status and links

Status: Published article · checked 2026-11-12

The open-text link is the authors' version of the journal work. The 1998 Mathematics of Computation article expands an extended abstract presented at STOC 1995; the two publication dates identify different versions.

Cited in: Not cited in an article.

158
Paper2002VanHoeij2002

Factoring polynomials and the knapsack problem

van Hoeij, Mark. Journal of Number Theory, 95(2), 167–189, 2002.

Replaces the recombination search in modular factorization with a structured knapsack problem solved by lattice reduction.

Status and links

Status: Published article · checked 2026-11-12

The open-text link is the author's version. The journal publication is August 2002; the year 2001 embedded in its DOI is not the publication year.

Cited in: Polynomial factorization algorithms

159
Paper2009BHKS2009

Factoring polynomials over global fields

Belabas, Karim and van Hoeij, Mark and Klüners, Jürgen and Steel, Allan. Journal de théorie des nombres de Bordeaux, 21(1), 15–39, 2009.

Establishes polynomial-time complexity for van Hoeij's original rational factorization algorithm and natural variants. It also treats global-field extensions of the approach and bivariate factorization over finite fields.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Polynomial factorization algorithms

160
Paper1973Stauduhar1973

The determination of Galois groups

Stauduhar, R. P. Mathematics of Computation, 27(124), 981–996, 1973.

Introduces subgroup descent using relative invariants and resolvents, a method underlying later Galois-group algorithms.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Resolvents and subgroup tests · Algorithms for Galois groups

161
Paper1985LandauMiller1985

Solvability by radicals is in polynomial time

Landau, Susan and Miller, Gary Lee. Journal of Computer and System Sciences, 30(2), 179–208, 1985.

Shows that deciding solvability by radicals for rational polynomials is possible in polynomial time. This decision problem should be distinguished from constructing an entire splitting field or listing every element of a large Galois group.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Algorithms for Galois groups

162
Paper1985SoicherMcKay1985

Computing Galois groups over the rationals

Soicher, Leonard and McKay, John. Journal of Number Theory, 20(3), 273–281, 1985.

Develops practical computational methods using resolvents and low-degree transitive groups. The paper also gives rational realizations of the transitive permutation groups in degrees three through seven.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

163
Paper1991Dummit1991

Solving solvable quintics

Dummit, David S. Mathematics of Computation, 57(195), 387–401, 1991.

A concrete sextic-resolvent treatment of solvable irreducible quintics and radical expressions. Use it with Robin Chapman's 1992 correction to the proof of Theorem 1 and the numerical errata on the author's webpage.

Status and links

Status: Published article; corrections available · checked 2026-11-11

Cited in: Not cited in an article.

164
Paper2000GeisslerKlueners2000

Galois group computation for rational polynomials

Geissler, Katharina and Klüners, Jürgen. Journal of Symbolic Computation, 30(6), 653–674, 2000.

Develops Galois-group computation using p-adic roots and refinements of Stauduhar’s method, preceding Fieker and Klüners’s approach without an a priori degree bound.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

165
Paper2000KluenersMalle2000

Explicit Galois realization of transitive groups of degree up to 15

Klüners, Jürgen and Malle, Gunter. Journal of Symbolic Computation, 30(6), 675–716, 2000.

Constructs explicit rational polynomials realizing all transitive groups of degree at most fifteen and organizes the constructions by permutation group.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Inverse Galois theory and generic polynomials

166
Paper2013DokchitserDokchitser2013

Identifying Frobenius elements in Galois groups

Dokchitser, Tim and Dokchitser, Vladimir. Algebra & Number Theory, 7(6), 1325–1352, 2013.

Identifies Frobenius conjugacy classes beyond the factor-degree data of reduction modulo a prime, distinguishing classes that share a cycle type in the chosen permutation representation.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Algorithms for Galois groups

167
Paper2014FiekerKlueners2014

Computation of Galois groups of rational polynomials

Fieker, Claus and Klüners, Jürgen. LMS Journal of Computation and Mathematics, 17(1), 141–158, 2014.

Constructs relative invariants for Galois-group computation without an a priori degree bound. The method underlies current Magma computations, subject to practical time and memory limits.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Foundations: polynomials, fields, and Galois groups · Resolvents and subgroup tests · Algorithms for Galois groups

168
Book1993Cohen1993

A Course in Computational Algebraic Number Theory

Cohen, Henri. Springer, Graduate Texts in Mathematics, vol. 138, 1993.

Develops algorithms for polynomial factorization, number fields, and Galois-group computation, with the arithmetic needed for their implementation.

Status and links

Status: Published book · checked 2026-11-11

Cited in: Not cited in an article.

169
Book2013GathenGerhard2013

Modern Computer Algebra

von zur Gathen, Joachim and Gerhard, Jürgen. Edition 3. Cambridge University Press, 2013.

Treats polynomial arithmetic, finite-field factorization, Hensel lifting, and factorization over the rationals, with complexity models and algorithmic proofs.

Status and links

Status: Published book · checked 2026-11-11

Cited in: Foundations: polynomials, fields, and Galois groups · Root bounds and prime-value criteria · Polynomial factorization algorithms

170
Paper2001KluenersMalle2001

A database for field extensions of the rationals

Klüners, Jürgen and Malle, Gunter. LMS Journal of Computation and Mathematics, 4, 182–196, 2001.

Explains the arithmetic database, its construction methods, and its emphasis on Galois groups and signatures. Consult the live database separately, since its coverage has grown beyond the original paper.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Not cited in an article.

171
ResourceUndatedFLINTFactorizationDocumentation

FLINT documentation: polynomial factorization algorithms

The FLINT Team.

Official explanations of finite-field and integer-polynomial factorization, connecting Berlekamp, Cantor–Zassenhaus, Hensel lifting, and lattice recombination with library routines. These are implementation guides; use the cited original papers for theorem statements and complexity proofs.

Status and links

Status: Maintained software documentation; revision in progress · checked 2026-11-12

The documentation was undergoing a major revision when checked. Its October 2026 banner states that parts of the text were generated by an LLM and asks readers to report inaccuracies. Mathematical claims in this atlas are independently supported by the original research papers.

Cited in: Irreducibility over finite fields · Polynomial factorization algorithms

172
ResourceUndatedKluenersMalleDatabase

A database for number fields

Klüners, Jürgen and Malle, Gunter.

A source of defining polynomials indexed by Galois group and signature. At access, the site reports coverage through degree twenty-three for all transitive groups except M23, with stated limitations on signatures and discriminant minima.

Status and links

Status: Maintained mathematical database · checked 2026-11-11

Cited in: Not cited in an article.

173
ResourceUndatedLMFDBFieldsGroups

The L-functions and Modular Forms Database: number fields and Galois groups

The LMFDB Collaboration.

Searchable number-field records and transitive-group data, with labels, invariants, and links between objects. Consult the completeness and reliability pages for each collection; a group appearing in a transitive-group catalogue does not by itself prove its realization over the rationals.

Status and links

Status: Maintained mathematical database · checked 2026-11-12

Number-field completeness is bounded by degree, signature, discriminant, or ramification conditions. The reliability page marks certain class-group and unit data that depend on GRH. Transitive-group catalogue completeness is a separate statement and does not establish realization over the rationals.

Cited in: Algorithms for Galois groups

174
ResourceUndatedMagmaGaloisDocumentation

Magma Handbook: Galois groups

Magma Computational Algebra System.

Official documentation for the Stauduhar-based GaloisGroup implementation, with no fixed degree cap for the documented integer, rational and number-field polynomial inputs. GaloisGroup does not itself certify its conditional steps; the documented GaloisProof overloads attempt certification for integer polynomials or absolute number fields. Record a successful result and the exact input/options.

Status and links

Status: Maintained software documentation · checked 2026-11-12

Cited in: Algorithms for Galois groups

175
ResourceUndatedPARIDocumentation

PARI/GP reference manual: general number fields and polgalois

The PARI Group.

Official reference for polgalois and number-field computations. PARI/GP 2.19 requires irreducible rational input of degree at most seven, or eleven with galdata. The manual explicitly warns that insufficient initial precision can rarely produce a wrong result; record precision, output convention, and version.

Status and links

Status: Maintained software documentation · checked 2026-11-11

Cited in: Algorithms for Galois groups

176
ResourceUndatedSageGaloisDocumentation

SageMath reference manual: polynomial and number-field Galois groups

The Sage Developers.

Official interfaces for polynomial and number-field Galois groups. SageMath 10.10 documents PARI through degree 11, GAP fallback with a documented range through degree 15 and some higher examples, and a Magma wrapper limited by group identification through degree 30. The number-field interface distinguishes original-root and Galois-closure actions and warns about absolute versus relative ground fields. A wrapper is not an independent backend proof.

Status and links

Status: Maintained software documentation · checked 2026-11-11

Cited in: Algorithms for Galois groups

177
Paper1986Ruppert1986

Reduzibilität ebener Kurven

Ruppert, Wolfgang M. Journal für die reine und angewandte Mathematik, 369, 167–191, 1986.

A classical source on reducibility of plane curves and algebraic criteria for absolute irreducibility. This is a multivariate question: a univariate polynomial of degree greater than one always splits over an algebraic closure.

Status and links

Status: Published article · checked 2026-11-11

Bibliographic details checked in Lecerf's survey and an AMS bibliography; the publisher full text was not retrieved.

Cited in: Not cited in an article.

178
Paper1995Kaltofen1995

Effective Noether irreducibility forms and applications

Kaltofen, Erich. Journal of Computer and System Sciences, 50(2), 274–295, 1995.

Gives effective bounds for algebraic irreducibility criteria, with applications to exceptional specializations in several variables and to factorization complexity.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomials in several variables · Factorization in several variables

179
Paper2001Gao2001Polytopes

Absolute irreducibility of polynomials via Newton polytopes

Gao, Shuhong. Journal of Algebra, 237(2), 501–520, 2001.

Uses integral indecomposability of Newton polytopes to obtain absolute irreducibility criteria for sparse multivariate polynomials. Monomial factors must be excluded when applying a polytope criterion to a polynomial.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Newton polytopes and irreducibility

180
Paper2003Gao2003PDE

Factoring multivariate polynomials via partial differential equations

Gao, Shuhong. Mathematics of Computation, 72(242), 801–822, 2003.

A factorization method based on a differential equation and linear algebra, in characteristic zero or sufficiently large characteristic. Connects rational and absolute factorization and provides an effective reduction from multivariate to bivariate problems.

Status and links

Status: Published article · checked 2026-11-11

Cited in: Polynomials in several variables · Factorization in several variables

181
Paper2013Lecerf2013

Factorisation des polynômes à plusieurs variables

Lecerf, Grégoire. Journées Nationales de Calcul Formel (13–17 May 2013), CIRM, Les cours du CIRM, 1–85, 2013.

A French-language course on multivariate factorization, including absolute factorization and computational algebraic geometry, with an extensive bibliography.

Status and links

Status: Published lecture notes · checked 2026-11-12

Journées Nationales de Calcul Formel, 13–17 May 2013, talk 2.

Cited in: Factorization in several variables

182
Notes2016FilasetaCourse2016

Math 788F: The Theory of Irreducible Polynomials

Filaseta, Michael. University of South Carolina course materials, 2016.

Provides a syllabus, problems, and an introduction to Newton polygons for a course on irreducibility methods. The page does not currently link openly to every chapter of the proposed book.

Status and links

Status: Expository notes · checked 2026-11-11

Cited in: Not cited in an article.

183
NotesUndatedConradAllPrimes

An irreducible that factors modulo all primes

Conrad, Keith. Author-hosted expository note.

Explains why irreducibility over the rationals need not be detectable by one irreducible reduction. The obstruction is visible in the cycle types available in the Galois group.

Status and links

Status: Expository notes · checked 2026-11-11

Undated; accessed 11 November 2026.

Cited in: Field extensions and minimal polynomials · The Galois correspondence and intermediate fields · Reduction modulo primes · Schönemann–Eisenstein and Dumas criteria · Root bounds and prime-value criteria · Frobenius and factorization modulo primes

184
NotesUndatedConradCubicQuartic

Galois groups of cubics and quartics (not in characteristic 2)

Conrad, Keith. Author-hosted expository note.

Worked low-degree classifications using discriminants and resolvents. The characteristic restriction matters; the author’s collection also contains a separate all-characteristics treatment.

Status and links

Status: Expository notes · checked 2026-11-11

Undated; accessed 11 November 2026.

Cited in: Discriminants, parity, and ramification · Resolvents and subgroup tests · Specialization and Hilbert irreducibility · Exceptional specializations · Critical points and polynomial monodromy · Branched covers and rigidity · Inverse Galois theory and generic polynomials · Algorithms for Galois groups

186
NotesUndatedConradIrredQ

Irreducibility tests in Q[T]

Conrad, Keith. Author-hosted expository note.

Proves Gauss’s lemma, the reduction-modulo-a-prime criterion, and Eisenstein’s criterion, establishing the prerequisites for more specialized irreducibility tests.

Status and links

Status: Expository notes · checked 2026-11-11

Undated; accessed 11 November 2026.

Cited in: Foundations: polynomials, fields, and Galois groups · Reduction modulo primes · Irreducibility from integer values · Frobenius and factorization modulo primes · Littlewood polynomials

187
NotesUndatedConradModP

Galois groups over Q and factorizations mod p

Conrad, Keith. Author-hosted expository note.

Explains how squarefree factorizations modulo good primes produce cycle types in a Galois group, with an explicit discriminant condition.

Status and links

Status: Expository notes · checked 2026-11-11

Undated; accessed 11 November 2026.

Cited in: Frobenius and factorization modulo primes · Trinomials · Taylor polynomials and Katz–Rivin questions · Gleason and Misiurewicz polynomials

188
NotesUndatedConradSnAn

Recognizing Galois groups S_n and A_n

Conrad, Keith. Author-hosted expository note.

Gives permutation-group recognition criteria and examples that use modular factorization and real roots to identify S_n or A_n.

Status and links

Status: Expository notes · checked 2026-11-12

Undated; accessed 11 November 2026.

Cited in: Frobenius and factorization modulo primes · Transitivity, primitivity, and cycle criteria · Trinomials · Gleason and Misiurewicz polynomials

189
Preprint2026SiksekStoll2026

Hilbert’s Irreducibility for Gm\mathbb{G}_m

Siksek, Samir and Stoll, Michael. arXiv preprint, 2026.

Describes exceptional S-unit fibers of a curve cover as a finite set together with finitely many power cosets. Theorem 3 makes the cosets effective but leaves the finite remainder ineffective; Corollary 1 characterizes infinitely many reducible f(x)−p_1^{e_1}⋯p_s^{e_s}.

Status and links

Status: Preprint; version 1, 3 September 2026 · checked 2026-11-11

Source title uses the notation G_m for the multiplicative group; author order in the PDF is Samir Siksek and Michael Stoll.

Cited in: Specialization and Hilbert irreducibility

190
Preprint2026Stoll2026Arboreal

When do all iterates of x²+a have maximal Galois group?

Stoll, Michael. arXiv preprint, 2026.

Reworks quadratic critical-orbit criteria and extends explicit sufficient conditions to rational parameters. Theorem 6.1 imposes region and congruence restrictions; Conjecture 8.1 asks for uniform finite-level detection. Neither the computational evidence nor the reported formalization establishes that conjecture in general.

Status and links

Status: Preprint; version 1, 10 November 2026 · checked 2026-11-12

Cited in: Composition and iteration · Arboreal Galois groups

191
Paper2001GaoLauder2001

Decomposition of Polytopes and Polynomials

Gao, Shuhong and Lauder, Alan G. B. Discrete & Computational Geometry, 26(1), 89–104, 2001.

Relates Minkowski decompositions of lattice polytopes to possible polynomial factors, gives polygon-decomposition algorithms, and develops projection tests in higher dimension. Corollary 2 gives an absolute-irreducibility certificate with the necessary exclusion of monomial factors. A decomposable polytope is inconclusive.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomials in several variables · Newton polytopes and irreducibility

192
ResourceUndatedDLMFBernoulliEuler

Bernoulli and Euler Polynomials (Chapter 24)

NIST Digital Library of Mathematical Functions. NIST Digital Library of Mathematical Functions.

Gives conventions, generating identities, Bernoulli denominator arithmetic, and complete multiple-root classifications: every B_n is squarefree; E_5 is the unique Euler exception. Appell Euler polynomials are distinct from Eulerian descent polynomials.

Status and links

Status: Maintained reference resource · checked 2026-11-11

Cited in: Reciprocal polynomials · Bernoulli and Euler polynomials

193
Preprint2026Deng2026Legendre

A proof of the irreducibility conjecture for Legendre polynomials

Deng, Zikang. arXiv preprint, 2026.

Preprint claiming a proof of Stieltjes’ irreducibility conjecture for parity-normalized Legendre polynomials in every degree, using upper and lower bounds for a resultant. Included to keep the historical conjecture record current; the full proof has not been independently verified in this atlas.

Status and links

Status: Preprint claim; version 2, 27 September 2026; no peer-reviewed publication verified · checked 2026-11-11

Cited in: Hermite, Bessel, and Legendre polynomials

194
Paper1984Heidrich1984Eulerian

On the factorization of Eulerian polynomials

Heidrich, Arnošt J. J. Journal of Number Theory, 18(2), 157–168, 1984.

Studies arithmetic factorization of Eulerian polynomials, including the lower bound p−1 for the degree of a large irreducible factor when p is the largest prime not exceeding the index. The atlas gives an elementary Newton-polygon derivation and the prime-plus-one consequence.

Status and links

Status: Published article; original full text not accessed in this review · checked 2026-11-11

Publication metadata cross-checked in the University of Utah journal bibliography; the factor-degree result is attributed to Heidrich in the introduction of Ta Thi Hoai An and Ngo Quoc Hoan, Multiple Eulerian polynomials. No original-paper theorem number is claimed.

Cited in: Eulerian polynomials

195
Paper2025ChidambaramMinacNguyenTan2025

Fekete polynomials of principal Dirichlet characters

Chidambaram, Shiva and Mináč, Ján and Nguyen, Tung T. and Tân, Nguyen Duy. Journal of Experimental Mathematics, 1(1), 51–93, 2025.

Studies the 0/1 polynomials associated with principal Dirichlet characters: cyclotomic factors, the remaining polynomial, separability, and Galois groups. Distinct from the prime-conductor quadratic-character family; records conjectures suggested by calculations.

Status and links

Status: Published article · checked 2026-11-12

Use publisher year2025, volume1(1), pp51–93. Some discovery indexes display2026, but the journal page and PDF state2025.

Cited in: Fekete polynomials

196
Paper2008Dilcher2008MultipleZeros

On multiple zeros of Bernoulli polynomials

Dilcher, Karl. Acta Arithmetica, 134(2), 149–155, 2008.

Completes the proof that every Bernoulli polynomial is squarefree, using Brillhart’s restriction on possible multiple roots and congruences for centered expansions. Section 4 recalls that E_5 is the unique Euler polynomial with multiple roots.

Status and links

Status: Published work · checked 2026-11-11

Cited in: Bernoulli and Euler polynomials

197
Paper2003Kimura2003Bernoulli

On universal higher order Bernoulli numbers and polynomials

Kimura, Noriaki. Report of the Research Institute of Industrial Technology, Nihon University, Report 70, 1–22, 2003.

Research report on Bernoulli families and generalizations. Section 2 states Carlitz’s even-index irreducibility criterion and its relation to McCarthy’s base-p digit-sum condition; later sections discuss higher-order and universal versions.

Status and links

Status: Published work · checked 2026-11-11

Report number 70 (2003), ISSN 0386-1678. The report’s definition of p-Eisenstein indexes coefficients in descending order; the atlas uses the equivalent usual Eisenstein criterion on the reciprocal polynomial.

Cited in: Bernoulli and Euler polynomials

198
Paper2017PatelSiksek2017Powers

On powers that are sums of consecutive like powers

Patel, Vandita and Siksek, Samir. Research in Number Theory, 3, Article 2, 2017.

Proves an unconditional derangement theorem for even Bernoulli Galois groups, using 2-adic Newton polygons and decomposition groups. Applies Chebotarev to equations involving sums of powers; records the even-index irreducibility conjecture.

Status and links

Status: Published work · checked 2026-11-11

Cited in: Bernoulli and Euler polynomials

199
Notes2020Milne2020ANT

Algebraic Number Theory (v3.08)

Milne, James S. Author course notes, 166 pages, 2020.

Free notes supplying precise proofs of the discriminant–index identity, prime decomposition, Hensel lifting, unramified extensions, decomposition groups, and tame/wild inertia. Version 3.08 is dated 19 July 2020; this is a different work from Fields and Galois Theory.

Status and links

Status: Author course notes; version 3.08, 19 July 2020 · checked 2026-11-11

Cited in: Ramification and inertia

200
Preprint2026ODorney2026Twisted

Galois groups of twisted reciprocal polynomials: a uniform asymptotic

O'Dorney, Evan M. arXiv preprint, 2026.

For fixed integers b≠0 and m≥4, proposes asymptotics for separable integer b-reciprocal polynomials of degree 2m whose Galois group is smaller than the full hyperoctahedral group. In the specified weighted Euclidean height, the exceptional counts have main terms proportional to H^m log H in the nonmonic family and H^{m−1} log H in the monic family.

Status and links

Status: Preprint; v1 (25 September 2026) · checked 2026-11-12

Theorem 1.1, equations (2)–(7), and §2.1 of v1 were checked in the full primary text on 12 November 2026. The positive leading constants and error terms depend on the fixed degree and twist; the errors are O(H^m) and O(H^{m−1}), respectively. This verifies the statement and conventions, not the full proof.

Cited in: Twisted reciprocity and square discriminants

201
Paper2012GuardiaMontesNart2012Newton

Newton polygons of higher order in algebraic number theory

Guàrdia, Jordi and Montes, Jesús and Nart, Enric. Transactions of the American Mathematical Society, 364(1), 361–416, 2012.

Develops Ore’s higher Newton polygons for local factorization. Product and residual-polynomial theorems refine slope restrictions to irreducibility certificates, and higher-order indices control termination. These methods address repeated factors in reduction and cases where a first Newton polygon is inconclusive. Theorem numbers cited in this atlas refer to arXiv v2 where indicated.

Status and links

Status: Published article; open author preprint v2 (2008) · checked 2026-11-12

Cited in: Newton polygons and Galois groups · Polynomial factorization algorithms

202
Paper2011GuardiaMontesNart2011Montes

Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields

Guàrdia, Jordi and Montes, Jesús and Nart, Enric. Journal de théorie des nombres de Bordeaux, 23(3), 667–696, 2011.

Presents an optimized Montes method using types and their representatives. Complete types identify irreducible local factors and reveal ramification indices and residue degrees; the algorithm computes prime ideal decomposition and local index information without requiring a global integral basis first.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Newton polygons and Galois groups · Polynomial factorization algorithms

203
Paper2022PoteauxWeimann2022Local

Local Polynomial Factorisation: Improving the Montes Algorithm

Poteaux, Adrien and Weimann, Martin. Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation (ISSAC ’22), 149–157, 2022.

Improves local irreducibility and factorization using generalized Hensel lifting, approximate roots, and divide-and-conquer. The sharper complexity bounds require residue characteristic zero or sufficiently large; the source separately includes residual-field factorization costs. A same-title arXiv record, 2607.02153 (2 July 2026), is linked as a related deposit, not a separate discovery; its full text could not be retrieved in this audit.

Status and links

Status: Published conference paper (5 July 2022); related 2026 arXiv deposit · checked 2026-11-12

Cited in: Polynomial factorization algorithms

204
Paper1989KappeWarren1989Quartic

An Elementary Test for the Galois Group of a Quartic Polynomial

Kappe, Luise-Charlotte and Warren, Bette. The American Mathematical Monthly, 96(2), 133–137, 1989.

Original source of the elementary quartic-group test that separates cyclic and dihedral cases after the cubic resolvent and discriminant tests. Publisher metadata verified; the full formulation and proof used in this atlas are checked in Conrad’s author-hosted exposition, Theorem 4.1. The publisher also assigns DOI 10.1080/00029890.1989.11972158.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Resolvents and subgroup tests

205
Paper1978BrentKung1978

Fast algorithms for manipulating formal power series

Brent, Richard P. and Kung, Hsiang-Tsung. Journal of the ACM, 25(4), 581–595, 1978.

Classical fast composition and reversion algorithms. The baby-step/giant-step matrix method also underlies modular composition; distinguish the arbitrary-modulus version from techniques that use the special modulus x^n. The author page records an erratum on page 590.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial factorization algorithms

206
Paper2011KedlayaUmans2011

Fast polynomial factorization and modular composition

Kedlaya, Kiran S. and Umans, Christopher. SIAM Journal on Computing, 40(6), 1767–1802, 2011.

Proves a near-linear bit-complexity bound for modular composition over finite fields, yielding the degree-3/2 randomized factorization benchmark. The method uses multivariate evaluation and supports fast Frobenius iteration; its bit-complexity bounds differ from field-operation bounds. Corollary 7.2 states the modular-composition bound for each fixed positive epsilon.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial factorization algorithms

207
Paper2016GuoNarayananUmans2016

Algebraic problems equivalent to beating exponent 3/2 for polynomial factorization over finite fields

Guo, Zeyu and Narayanan, Anand Kumar and Umans, Chris. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), LIPIcs, 58, 47:1–47:14, 2016.

Relates finite-field factorization to other algebraic problems by reductions, identifying improvements that would lower its degree exponent below 3/2. These equivalences do not establish optimality of the exponent 3/2.

Status and links

Status: Published conference paper · checked 2026-11-12

Cited in: Polynomial factorization algorithms

208
Paper2024NeigerSalvySchostVillard2024

Faster modular composition

Neiger, Vincent and Salvy, Bruno and Schost, Éric and Villard, Gilles. Journal of the ACM, 71(2), Article 11, 2024.

A Las Vegas algorithm for modular composition over arbitrary fields of known characteristic, with expected arithmetic complexity O(n^1.43). Polynomial matrices encode algebraic relations. Theorem 1.1 detects failed trials; the discussion handles small finite fields by extension. This counts field operations, unlike finite-field bit-complexity bounds.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial factorization algorithms

209
Paper2026NeigerSalvySchostVillard2026

Faster modular composition using two relation matrices

Neiger, Vincent and Salvy, Bruno and Schost, Éric and Villard, Gilles. Proceedings of the 51st International Symposium on Symbolic and Algebraic Computation (ISSAC 2026), 315–324, 2026.

Theorem 1.3 improves algebraic modular composition to soft-O(n^((omega+3)/4)) for generic inner polynomials relative to a fixed modulus. Genericity failure is detected; an arbitrary-input Las Vegas reduction is left as a research question. Published at ISSAC 2026, with the published version on arXiv v2.

Status and links

Status: Published conference paper · checked 2026-11-12

Cited in: Polynomial factorization algorithms

210
Paper2026HoevenLecerf2026

Fast modular composition using spiroids

van der Hoeven, Joris and Lecerf, Grégoire. Journal of Complexity, 96, 102073, 2026.

Gives a sharper nearly linear bit bound for modular composition over Z/rZ using structured complex evaluation points and controlled-precision Fourier transforms. Prime finite fields are included. The authors distinguish asymptotic improvement from practical competitiveness. Journal publication is October 2026.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial factorization algorithms

211
Preprint2025UmansWang2025

A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization

Umans, Chris and Wang, Siki. arXiv:2511.10851; listed for ISAAC 2026, 2025.

Proposes a structured divisibility-covering conjecture which, under the paper’s hypotheses, would improve the degree exponent for finite-field factorization below 3/2. The improvement is conditional. The work is available as a 2025 preprint and was listed in the December 2026 ISAAC program at the verification date.

Status and links

Status: Preprint; listed for ISAAC 2026 · checked 2026-11-12

Cited in: Polynomial factorization algorithms

212
Paper2020Doris2020

Computing the Galois group of a polynomial over a p-adic field

Doris, Christopher. International Journal of Number Theory, 16(8), 1767–1801, 2020.

Develops local Galois-group algorithms using resolvents, ramification, and global models; a local group occurs as a decomposition subgroup in a global computation. Remark 3.5 records a heuristic precision bound in the original implementation. The linked package separately documents an exact p-adic input mode for proved results.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Algorithms for Galois groups

213
Paper2019Porritt2019Restricted

Irreducible polynomials over a finite field with restricted coefficients

Porritt, Sam. Canadian Mathematical Bulletin, 62, 429–439, 2019.

Counts monic irreducibles when every nonleading coefficient avoids a common small forbidden set. Theorem 1 gives explicit q,n,|R| conditions and a constant-term correction; Theorem 2 uses additional interval structure. The field-size and degree ranges matter.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Irreducible polynomials with coefficient restrictions

214
Paper2025Cheng2025Restricted

Counting irreducible polynomials with restricted coefficients

Cheng, Kaimin. Finite Fields and Their Applications, 108, Article 102691, 2025.

Extends the common-forbidden-set model to position-dependent forbidden sets. Theorem 1.1 allows at most √q/2 exclusions per coefficient for q≥300 and sufficiently large degree; Corollary 1.3 treats avoiding one specified value at every position. Includes the necessary constant-term density factor.

Status and links

Status: Published article · checked 2026-11-12

Issue date December 2025. The publisher-indexed article preview supplies Theorem 1.1 and Corollary 1.3; direct page fetching intermittently returns HTTP 403.

Cited in: Irreducible polynomials with coefficient restrictions

215
Paper2026BarySorokerShmueli2026Squares

Irreducibility of polynomials with square coefficients over finite fields

Bary-Soroker, Lior and Shmueli, Roy. Finite Fields and Their Applications, 109, Article 102714, 2026.

For fixed degree n, independent nonleading coefficients uniform on the set of square values give irreducibility probability 1/n+O_n(q^(−1/2)) as q grows. Theorem 2 covers more general sets of bounded algebraic complexity. Uniform square values differ from squaring uniform field elements in odd characteristic.

Status and links

Status: Published article · checked 2026-11-12

Published January 2026; DOI contains 2025. Mathematical theorem locators refer to the public author preprint v1, while publication metadata is verified from the author institution and publisher.

Cited in: Irreducible polynomials with coefficient restrictions · Factorization statistics over finite fields

216
Paper2025BarySorokerGarzoniMatei2025Powers

On the irreducibility of f(2^n,3^m,X) and other such polynomials

Bary-Soroker, Lior and Garzoni, Daniele and Matei, Vlad. Mathematische Zeitschrift, 310, Article 11, 2025.

Under GRH and the geometric pullback condition (PB), Theorem 1.1 proves density-one irreducibility along independent power parameters. The power-pullback condition is stronger than generic irreducibility and excludes X²−t. Theorem 1.1 counts exponent vectors in symmetric boxes, including negative exponents.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Specialization and Hilbert irreducibility

217
Paper2025BenedettoGhiocaJuulTucker2025Periodic

Arboreal Galois groups of postcritically finite quadratic polynomials: The periodic case

Benedetto, Robert L. and Ghioca, Dragos and Juul, Jamie and Tucker, Thomas J. Journal of the London Mathematical Society, 112(2), e70257, 2025.

Describes groups for x²+c with periodic critical point in characteristic different from two. Theorem 1.5 gives equivalent square-root, finite-level, and all-level conditions for attaining the specified constrained group, which is not the full binary-tree automorphism group. The target point and cyclotomic constants enter the hypotheses.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Composition and iteration · Arboreal Galois groups

218
Paper2026BenedettoGhiocaJuulTucker2026Preperiodic

Arboreal Galois groups of postcritically finite quadratic polynomials: The strictly preperiodic case

Benedetto, Robert L. and Ghioca, Dragos and Juul, Jamie and Tucker, Thomas J. Canadian Journal of Mathematics, 2026.

Complements the periodic case by treating strictly preperiodic critical orbits of x²+c. Separates short-tail and long-tail cases and gives criteria for the resulting constrained groups. Section 1.4 excludes the already-classical Chebyshev map x²−2, whose towers admit a Kummer description.

Status and links

Status: Published article · checked 2026-11-12

Published online 30 March 2026; no unverified final volume or page range assigned. Mathematical locators refer to author preprint v1.

Cited in: Composition and iteration · Arboreal Galois groups

219
Paper2016LaishramShorey2016III

Irreducibility of generalized Hermite–Laguerre polynomials III

Laishram, Shanta and Shorey, Tarlok N. Journal of Number Theory, 164, 303–322, 2016.

All-degree irreducibility for eight third- and quarter-integer Laguerre parameters, with (q,n)=(1/4,2) exceptional. Only the ordinary assertion is used: the printed power-substitution wording needs qualification because L_1^(-3/4)(x⁴)=1/4−x⁴ is reducible.

Status and links

Status: Published · checked 2026-11-12

Cited in: Generalized Laguerre polynomials · Hermite, Bessel, and Legendre polynomials

220
Paper2021GrosuGrosu2021

The irreducibility of some Wronskian Hermite polynomials

Grosu, Codruţ and Grosu, Corina. Indagationes Mathematicae, 32(2), 456–497, 2021.

Studies arithmetic and zeros of two-part Wronskian Hermite families using Newton polygons and Schur congruences. The atlas’s restatement of Theorem 2 excludes the unit remainder R_(2,1)=1, since irreducibility here requires a nonconstant polynomial.

Status and links

Status: Published · checked 2026-11-12

Cited in: Hermite, Bessel, and Legendre polynomials

221
Paper2022BanerjeeBera2022

Classifying families of orthogonal polynomials having Galois group the alternating group

Banerjee, Pradipto and Bera, Ranjan. Journal of Number Theory, 240, 31–49, 2022.

Extends the classification program from square discriminants to alternating Galois groups of generalized Laguerre polynomials, for integer α≠n, up to finitely many exceptions. The diagonal α=n remains outside the stated scope.

Status and links

Status: Published · checked 2026-11-12

Cited in: Generalized Laguerre polynomials

222
Paper2025Melotti2025Eulerian

Distribution of the roots of Eulerian polynomials

Melotti, Paul. Electronic Communications in Probability, 30, 1–7, 2025.

A combinatorial proof of the known log-Cauchy zero distribution, using moments that become exactly constant. The paper uses x times the Eulerian polynomial normalized here.

Status and links

Status: Published article; theorem locators refer to arXiv v2 · checked 2026-11-12

Final journal metadata is recorded in the publisher-deposited Crossref record. The statement and theorem locators were checked in arXiv:2507.15908v2; the final journal text was not independently inspected.

Cited in: Eulerian polynomials

223
Paper2026Chen2026Dodecic

Elementary characterization of the Galois groups of x^12+ax^6+b

Chen, Malcolm Hoong Wai. Mathematica Slovaca, 2026.

Classifies the 16 possible groups under irreducibility over Q. Lower-degree power compositions, square and cube tests, and a cubic resolvent give an explicit decision algorithm. Published online 2 September 2026.

Status and links

Status: Published · checked 2026-11-12

Cited in: Trinomials

224
Paper2025AwtreyPataneToone2025

On Galois groups of power compositional nonic polynomials

Awtrey, Chad and Patane, Frank and Toone, Brian. Bulletin of the Australian Mathematical Society, 112(3), 458–472, 2025.

Classifies the 11 possible transitive groups for irreducible g(x³), with g a rational monic cubic, using two discriminants and two resolvents. Also gives an algorithm to recognize number fields with such a defining polynomial. Online 10 February 2025; issue dated December 2025.

Status and links

Status: Published · checked 2026-11-12

Cited in: Trinomials

225
Paper2016PeledSenZeitouni2016

Double roots of random Littlewood polynomials

Peled, Ron and Sen, Arnab and Zeitouni, Ofer. Israel Journal of Mathematics, 213(1), 55–77, 2016.

Gives sharp parity-sensitive double-root asymptotics for fair-sign Littlewood polynomials. Separates the easier squarefreeness question from irreducibility and explains the dominant repeated roots at ±1.

Status and links

Status: Published · checked 2026-11-12

Theorem 1.2, specialized to fair signs; publication metadata confirmed by the publisher, arXiv and the author’s institutional record. Publisher and institutional abstract rendering interchanges formulas, so mathematical statements were checked against the full paper.

Cited in: Littlewood polynomials

226
Paper2017FeldheimSen2017

Double roots of random polynomials with integer coefficients

Feldheim, Ohad N. and Sen, Arnab. Electronic Journal of Probability, 22, Article 10, 1–23, 2017.

For bounded iid integer coefficients with largest atom at most 1/2, locates repeated-root probability at 0 and ±1 up to o(n^(-2)); when zero is excluded, obtains O(n^(-2)). Allowing zero coefficients can leave a persistent discriminant-zero event.

Status and links

Status: Published · checked 2026-11-12

Theorem 1.1. The model randomizes every coefficient, including the leading one; it is not stated as a fixed-monic theorem.

Cited in: Random polynomials: models and methods

227
Paper2009Kuba2009

On the distribution of reducible polynomials

Kuba, Gerald. Mathematica Slovaca, 59(3), 349–356, 2009.

Establishes sharp orders for reducible, not necessarily monic integer polynomials of fixed degree and bounded coefficient height: H^n in degree n≥3, and H^2 log H in degree two. Complements monic counting theorems and isolates the contribution of linear factors.

Status and links

Status: Published · checked 2026-11-12

Published in 2009; the author’s arXiv copy was deposited in 2020. Theorems 1–4 in that copy.

Cited in: Height bounds for exceptional Galois groups

228
Preprint2026BenPorath2026RootSubsets

Counting Polynomials via Galois Actions on Root Subsets

Ben-Porath, Or. 2026.

Obtains upper bounds for monic bounded-height polynomials with specified permutation representations, including actions on subsets, ordered tuples, and regular actions. The method recovers splitting fields from carefully chosen root-subset stabilizers and controls heights of their generators.

Status and links

Status: Preprint; arXiv version 1 · checked 2026-11-12

arXiv:2603.14617v1, submitted 15 March 2026

Theorems 1.1–1.4; Lemma 3.1 and Proposition 3.3 explain the root-subset mechanism. The HTML title page displays 24 August 2026 although the arXiv record lists only v1 submitted 15 March 2026; version identifier is retained explicitly.

Cited in: Height bounds for exceptional Galois groups

229
Paper2024EntinPopov2024

Probabilistic Galois theory in function fields

Entin, Alexei and Popov, Alexander. Finite Fields and Their Applications, 98, Article 102466, 2024.

Studies monic polynomials in y with independent uniformly bounded-degree coefficients in F_q[x]. The two limiting regimes differ: growing coefficient degree gives S_n with probability tending to one; growing y-degree gives irreducibility limit 1−q^(−d), and conditioned on irreducibility, the group is A_n or S_n with probability tending to one. The full-S_n refinement in odd characteristic uses a uniform polynomial Chowla conjecture. Entin’s later 2025 theorem removes the Chowla assumption when q is odd.

Status and links

Status: Published; earlier conditional full-group result superseded in odd characteristic · checked 2026-11-12

Theorems 1.1, 1.2, 1.4 and 1.6 checked in arXiv v3 (4 July 2024); the precise uniformity required for the conditional result is Conjecture 1.5. The publisher article endpoint could not be reopened during the 12 November 2026 second pass; publication metadata was retained from the earlier primary-publisher check.

Cited in: Random polynomials: models and methods

230
Preprint2025MichelenYakir2025Discriminant

Law of large numbers for the discriminant of random polynomials

Michelen, Marcus and Yakir, Oren. 2025.

Proves a universal first-order law for log absolute discriminant of iid mean-zero, variance-one sub-Gaussian Kac polynomials with no zero coefficient atom. Connects Mahler measure, reciprocal symmetry in distribution and root separation. A size asymptotic does not determine the discriminant’s square class.

Status and links

Status: Preprint; version 1 dated 13 June 2025 · checked 2026-11-12

arXiv:2506.12206v1

Theorem 1, equation (10), and §1.3. The abstract omits hypotheses that are explicit in Theorem 1; the atlas preserves them.

Cited in: Random polynomials: models and methods

231
Paper2026MichelenYakir2026RootSeparation

Limit law for root separation in random polynomials

Michelen, Marcus and Yakir, Oren. Advances in Mathematics, 496, Article 110990, 2026.

Establishes a limiting law for the smallest root separation at scale n^(-5/4) for mean-zero sub-Gaussian iid coefficients with no atom at zero. Corollary 1.2 implies squarefreeness with probability tending to one without the older integer-law largest-atom restriction.

Status and links

Status: Published · checked 2026-11-12

Theorem 1.1 and Corollary 1.2; published in June 2026. The sharp Littlewood repeated-root asymptotic of Peled–Sen–Zeitouni supplies a quantitative conclusion not contained in the limit statement alone.

Cited in: Random polynomials: models and methods

232
Paper1992Debes1992Powers

On the irreducibility of the polynomials P(t^m, Y)

Dèbes, Pierre. Journal of Number Theory, 42(2), 141–157, 1992.

Characterizes infinite reducibility along a geometric progression by a reducible scaled power pullback (Theorem 1.2). Under the geometric pullback condition (PB), one obtains irreducibility for all but finitely many integer exponents, unconditionally. The argument uses Siegel’s theorem; finiteness is distinct from effective enumeration of exceptional exponents.

Status and links

Status: Published article · checked 2026-11-12

Original scanned author-hosted paper inspected visually: Theorem 1.2 is on printed page 144. Publication metadata verified against the publisher and author list.

Cited in: Specialization and Hilbert irreducibility

233
Paper2004MahlburgOno2004

Arithmetic of certain hypergeometric modular forms

Mahlburg, Karl and Ono, Ken. Acta Arithmetica, 113(1), 39–55, 2004.

Formulates the irreducibility and full-symmetric-group conjecture for Kaneko–Zagier polynomials and proves infinitely many irreducibility cases. The introduction also records the distinct conjecture for Eisenstein-series divisor polynomials.

Status and links

Status: Published · checked 2026-11-12

Cited in: Kaneko–Zagier polynomials · Zero polynomials of Eisenstein series

234
Paper2024JindalNairShorey2024

Extension of irreducibility results on generalized Laguerre polynomials L_n^(-n-s-1)(x)

Jindal, Ankita and Nair, Saranya G. and Shorey, Tarlok N. Publicationes Mathematicae Debrecen, 105(3-4), 473–494, 2024.

Proves irreducibility of L_n^(-n-s-1) for every n≥1 and 9≤s≤92. For 61≤s≤92, Theorem 1.2(i) gives the full Galois classification, with ten explicit alternating cases. For 93≤s≤100, only the linear-factor exclusion is unconditional; the group statement assumes irreducibility.

Status and links

Status: Published · checked 2026-11-15

Full publisher PDF inspected: Theorems 1.1–1.3, Lemmas 2.10–2.11, and the exact exceptional pairs. Earlier abstract-only access note superseded. The publisher may require subscription access; no matching open full-text alternate was verified.

Cited in: Laguerre polynomials with negative parameters

235
Paper2012FelderHemeryVeselov2012

Zeros of Wronskians of Hermite polynomials and Young diagrams

Felder, Giovanni and Hemery, Adrian D. and Veselov, Alexander P. Physica D: Nonlinear Phenomena, 241(23-24), 2131–2137, 2012.

Relates Hermite-Wronskian zero patterns to partitions and monodromy-free Schrödinger operators. Section 6 states Veselov’s conjecture that every nonzero zero is simple; the origin is explicitly exempt.

Status and links

Status: Published · checked 2026-11-12

Cited in: Hermite, Bessel, and Legendre polynomials

236
Preprint2026NguyenDang2026Jacobi

Arithmetic of Jacobi polynomials

Nguyen-Dang, Khai-Hoan. Hexagon preprint, 2026.

Version 1 claims complete proofs of the Mahlburg–Ono conjecture for four Kaneko–Zagier families and of the Cullinan–Hajir Legendre Galois-group conjecture. Included as a dated claim; neither the full proof nor peer-reviewed publication was independently verified here.

Status and links

Status: Preprint claim; version 1, 22 October 2026; no peer-reviewed publication verified · checked 2026-11-12

Cited in: Hermite, Bessel, and Legendre polynomials · Kaneko–Zagier polynomials

237
Preprint2026NguyenDang2026UniformLaguerre

Uniform irreducibility and Galois groups of generalized Laguerre polynomials

Nguyen-Dang, Khai-Hoan. Hexagon preprint, 2026.

Claims a uniform eventual irreducibility and alternating-containment theorem for negative-integral Laguerre parameters, with an effective finite exceptional set. This is not an all-pair resolution of Hajir’s conjectures. The full proof has not been independently verified here.

Status and links

Status: Preprint claim; version 1, 4 November 2026; no peer-reviewed publication verified · checked 2026-11-12

Cited in: Laguerre polynomials with negative parameters

238
Paper2016CullinanGajekLeonard2016

On the Newton polygons of Kaneko–Zagier lifts of supersingular polynomials

Cullinan, John and Gajek-Leonard, Rylan. Research in Number Theory, 2, Article 34, 2016.

Computes Newton polygons of four rational supersingular-lift families. Their one-edge cases give further irreducibility results toward the Mahlburg–Ono conjecture.

Status and links

Status: Published · checked 2026-11-12

Cited in: Kaneko–Zagier polynomials

239
Paper2020BanerjeeBera2020Modifications

An irreducibility question concerning modifications of Laguerre polynomials

Banerjee, Pradipto and Bera, Ranjan. International Journal of Number Theory, 16(5), 1031–1051, 2020.

Addresses Hajir’s admissible-modification question. For fixed nonnegative r, gives an effective degree bound beyond which every allowed modification is irreducible; also classifies the possible linear-factor exceptions for r≤3.

Status and links

Status: Published · checked 2026-11-12

Published online 13 December 2019; volume year 2020. Abstract checked in publisher-provided preview.

Cited in: Laguerre polynomials with negative parameters

240
Paper2022ShoreySinha2022

Extension of Laguerre polynomials with negative arguments

Shorey, Tarlok N. and Sinha, Sneh Bala. Indagationes Mathematicae, 33(4), 801–815, 2022.

Studies arbitrary integral coefficient modifications with endpoint multipliers ±1. Proves restrictions on factor degrees and describes ranges where the polynomial is irreducible or a linear factor times an irreducible polynomial, with explicit exceptional possibilities.

Status and links

Status: Published · checked 2026-11-12

Cited in: Laguerre polynomials with negative parameters

241
Paper2022ShoreySinha2022II

Extension of Laguerre polynomials with negative arguments II

Shorey, Tarlok N. and Sinha, Sneh Bala. Indagationes Mathematicae, 33(4), 880–884, 2022.

Makes the exceptional-pair analysis for admissible modifications explicit through parameter s≤30, building on the preceding paper. The statements concern modified polynomials and must be distinguished from irreducibility of the unmodified Laguerre polynomial.

Status and links

Status: Published · checked 2026-11-12

Cited in: Laguerre polynomials with negative parameters

242
Paper2016DeAngelisMarcello2016

Wilf’s conjecture

De Angelis, Valerio and Marcello, Dominic. The American Mathematical Monthly, 123(6), 557–573, 2016.

Gives a corrected account of the 2-adic argument showing that at most one index other than 2 can have vanishing complementary Bell number. This concerns rational roots of Touchard polynomials, not their full irreducibility.

Status and links

Status: Published · checked 2026-11-12

Cited in: Touchard polynomials

243
Paper2013AmdeberhanDeAngelisMoll2013

Complementary Bell Numbers: Arithmetical Properties and Wilf’s Conjecture

Amdeberhan, Tewodros and De Angelis, Valerio and Moll, Victor H. In Kotsireas, Ilias S. and Zima, Eugene V. (editors), Advances in Combinatorics, Springer, Berlin, Heidelberg, 23–56, 2013.

Develops valuation methods for complementary Bell numbers and states Wilf’s nonvanishing problem. Read with De Angelis–Marcello (2016), which corrects errors in the earlier proof.

Status and links

Status: Published · checked 2026-11-12

Cited in: Touchard polynomials

244
Paper2017CameronMorgan2017

Algebraic properties of chromatic roots

Cameron, Peter J. and Morgan, Kerri. The Electronic Journal of Combinatorics, 24(1), P1.21, 2017.

States the α+n and nα conjectures, a conjecture about the nonlinear factor of a random graph’s chromatic polynomial, and the problem of characterizing graphs whose chromatic polynomial splits over Q.

Status and links

Status: Published · checked 2026-11-12

Cited in: Chromatic polynomials

245
Paper2012Bohn2012Chromatic

Chromatic roots as algebraic integers

Bohn, Adam. DMTCS Proceedings, FPSAC 2012, AR, 543–554, 2012.

Proves the α+n conjecture for quadratic and cubic algebraic integers and gives a dense set of chromatic roots satisfying the nα conjecture.

Status and links

Status: Published · checked 2026-11-12

The PDF is explicitly FPSAC 2012, pp. 543–554; the current repository page has an inconsistent December 2011 publication field.

Cited in: Chromatic polynomials

246
Paper2012Morgan2012Chromatic

Galois groups of chromatic polynomials

Morgan, Kerri. LMS Journal of Computation and Mathematics, 15, 281–307, 2012.

Computes groups for graph families and constructs infinite families with nonsymmetric groups. Its examples also show why groups of separate irreducible factors cannot simply be multiplied.

Status and links

Status: Published · checked 2026-11-12

Cited in: Chromatic polynomials

247
Paper2012BohnCameronMuller2012Tutte

Galois groups of multivariate Tutte polynomials

Bohn, Adam and Cameron, Peter J. and Müller, Peter. Journal of Algebraic Combinatorics, 36, 223–230, 2012.

Theorem 1 proves the symmetric-group result for the multivariate Tutte polynomial of a connected matroid. Conjecture 9 asks for the analogous result for the ordinary bivariate Tutte polynomial in characteristic zero.

Status and links

Status: Published · checked 2026-11-12

Cited in: Tutte polynomials

248
Preprint2025GoodallJouveSereni2025Tutte

On the irreducibility and monodromy of Tutte polynomials

Goodall, Andrew and Jouve, Florent and Sereni, Jean-Sébastien. arXiv:2510.05658v1, 2025.

Restates the full symmetric-group conjecture for connected matroids. Theorems 4.5 and 4.7 establish it for cycle graphs and for uniform matroids of fixed rank with sufficiently large ground set. Uniform matroids in all ranks and sizes are not covered by that statement.

Status and links

Status: Preprint · checked 2026-11-12

Cited in: Chromatic polynomials · Tutte polynomials

249
Paper2001MerinoDeMierNoy2001

Irreducibility of the Tutte polynomial of a connected matroid

Merino, Criel and de Mier, Anna and Noy, Marc. Journal of Combinatorial Theory, Series B, 83(2), 298–304, 2001.

Proves Brylawski’s irreducibility conjecture for connected matroids. This supplies transitivity over the rational function field, but does not determine the full Galois group.

Status and links

Status: Published · checked 2026-11-12

Cited in: Tutte polynomials

250
Paper2024Ramadas2024Moduli

Moduli Spaces of Quadratic Maps: Arithmetic and Geometry

Ramadas, Rohini. International Mathematics Research Notices, 2024(15), 11364–11370, 2024.

Relates irreducibility of quadratic Gleason polynomials over Q to geometric irreducibility of curves of quadratic rational maps with a periodic critical point.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Composition and iteration · Gleason and Misiurewicz polynomials

252
Paper2026BenedettoGoksel2026NonUnit

The non-unit conjecture for Misiurewicz parameters

Benedetto, Robert L. and Goksel, Vefa. Acta Arithmetica, 224(2), 117–139, 2026.

Proves further non-unit results under explicit irreducibility assumptions. The introduction records the unresolved irreducibility problem and distinguishes values of polynomials from differences of individual parameters.

Status and links

Status: Published article · checked 2026-11-12

Published 25 June 2026; theorem locators checked in author preprint v2.

Cited in: Gleason and Misiurewicz polynomials

253
Paper2018Buff2018PCF

On postcritically finite unicritical polynomials

Buff, Xavier. New York Journal of Mathematics, 24, 1111–1122, 2018.

Studies critical-parameter polynomials and disproves unrestricted higher-degree Gleason irreducibility: period three has a cyclotomic factor when the degree is 1 modulo 6.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Gleason and Misiurewicz polynomials

254
Paper2026BakerChenLiQian2026Necklaces

Necklaces, permutations, and periodic critical orbits for quadratic polynomials

Baker, Matthew and Chen, Andrea and Li, Sophie and Qian, Matthew. European Journal of Combinatorics, 134, 104352, 2026.

Gives bijections connecting real critical parameters and factorization of Gleason polynomials modulo 2. The introduction retains the rational irreducibility conjecture.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Gleason and Misiurewicz polynomials

255
Paper2020DeMarkEtAl2020Stability

Eventually stable quadratic polynomials over Q

DeMark, David and Hindes, Wade and Jones, Rafe and Misplon, Moses and Stoll, Michael and Stoneman, Michael. New York Journal of Mathematics, 26, 526–561, 2020.

Studies reciprocal-integer quadratic parameters. Conjectures 1.7 and 1.8 predict at most four factors and detection of stability at the second iterate.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Composition and iteration · Irreducibility of iterates

256
Paper2019Krumm2019Dynatomic

A finiteness theorem for specializations of dynatomic polynomials

Krumm, David. Algebra & Number Theory, 13(4), 963–993, 2019.

Proves that rational specializations with smaller-than-generic dynatomic Galois group are finite for periods 5, 6, 7, and 9. The exceptional parameters are not explicitly determined.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Specialization and Hilbert irreducibility

257
Paper2024LaishramYadav2024Truncated

Irreducibility and Galois groups of truncated binomial polynomials

Laishram, Shanta and Yadav, Prabhakar. International Journal of Number Theory, 20(6), 1663–1680, 2024.

Proves explicit ranges of irreducibility and conditional effective bounds for binomial truncations.

Status and links

Status: Published paper · checked 2026-11-12

Cited in: Truncated binomial polynomials

258
Paper2014DilcherEricksen2014Stern

Reducibility and irreducibility of Stern (0,1)-polynomials

Dilcher, Karl and Ericksen, Larry. Communications in Mathematics, 22(1), 77–102, 2014.

Studies Stern (0,1)-polynomials and states four factorization conjectures in §8.

Status and links

Status: Published paper · checked 2026-11-12

Cited in: Stern polynomials

259
Preprint2025Altizio2025Stern

Zeros of Stern polynomials in the complex plane

Altizio, David. arXiv, 2025.

Proves a zero-free disk and prime-index irreducibility for the Klavžar–Milutinović–Petr Stern sequence; records a half-plane conjecture.

Status and links

Status: Preprint · checked 2026-11-12

Cited in: Stern polynomials

261
Paper2019KoleyReddy2019Cyclotomic

Cyclotomic factors of Borwein polynomials

Koley, Biswajit and Reddy Arikatla, Satyanarayana. Bulletin of the Australian Mathematical Society, 100, 41–47, 2019.

Proves Mercer’s cyclotomic-divisor classification; keeps the stronger reducibility conjecture separate.

Status and links

Status: Published paper · checked 2026-11-12

Cited in: Five-term Newman polynomials

262
Paper2023KlahnTechnau2023Truncated

Galois groups of binom(n,0) + binom(n,1)X + ⋯ + binom(n,6)X⁶

Klahn, Benjamin and Technau, Marc. International Journal of Number Theory, 19(10), 2443–2450, 2023.

Proves that only finitely many sextic binomial truncations have group other than S₆, using a resolvent curve and Faltings’ theorem. Credits the earlier result of Rouse and Juillerat and restates the conjecture for every n≥11.

Status and links

Status: Published paper · checked 2026-11-12

Cited in: Truncated binomial polynomials

263
Thesis2021Juillerat2021Thesis

Widely Digitally Stable Numbers and Irreducibility Criteria for Polynomials With Prime Values

Juillerat, Jacob. University of South Carolina, doctoral dissertation, 2021.

The second part proves finiteness of exceptional sextic binomial Galois groups. Klahn–Technau credit Rouse and Juillerat and cite Theorem 1.3. The repository abstract was checked; the full dissertation was not accessible in this review.

Status and links

Status: Doctoral dissertation · checked 2026-11-12

Cited in: Truncated binomial polynomials

264
Paper2005GathenNocker2005

Polynomial and Normal Bases for Finite Fields

von zur Gathen, Joachim and Nöcker, Michael. Journal of Cryptology, 18(4), 337–355, 2005.

Studies finite-field arithmetic using sparse polynomial bases and normal bases. Conjectures 2.5 and 2.8 predict bounded-weight irreducible polynomials and irreducible polynomials x^n+h with deg h at most 3+log_q n. The author-hosted prepublication text retains these locators.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Sparse irreducible polynomials over finite fields

265
Paper2025Entin2025RationalFunction

Galois groups of random polynomials over the rational function field

Entin, Alexei. Journal of the London Mathematical Society, 111(1), Article e70061, 2025.

For fixed odd q and fixed d≥1, proves that a monic polynomial of increasing degree with independent uniform coefficients of degree at most d in F_q[t] has group S_n with probability tending to one conditional on irreducibility. This removes the Chowla hypothesis in the earlier odd-characteristic result.

Status and links

Status: Published article · checked 2026-11-12

Corollary 1.1 and Remark 1.4 checked in author text arXiv v2 (22 November 2024). The odd-characteristic assumption is absent from the abstract but explicit in the theorem.

Cited in: Random polynomials: models and methods

266
Paper2012GhitzaMcAndrew2012

Experimental evidence for Maeda’s conjecture on modular forms

Ghitza, Alexandru and McAndrew, Angus. Tbilisi Mathematical Journal, 5(2), 55–69, 2012.

States Maeda’s conjecture and verifies T_2 through weight 14000 using modular factorizations; Theorem 1.5 gives the precise range of other Hecke indices.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Hecke polynomials and Maeda’s conjecture

267
Paper2014Tsaknias2012

A possible generalization of Maeda’s conjecture

Tsaknias, Panagiotis. In Böckle, Gebhard and Wiese, Gabor (editors), Computations with Modular Forms, Springer, Cham, Contributions in Mathematical and Computational Sciences, 6, 317–329, 2014.

Questions 2.1–2.3 concern boundedness, stabilization and multiplicativity of Galois orbit counts at fixed level. Distinguishes CM from non-CM forms.

Status and links

Status: Published chapter; question locators checked in arXiv v1 (2012) · checked 2026-11-12

Cited in: Hecke polynomials and Maeda’s conjecture

268
Preprint2026BanerjeeEtAl2026

Towards a generalized Maeda conjecture for modular forms with quadratic nebentypus

Banerjee, Debargha and Das, Dhrubajyoti and Das, Srijan and Mandal, Tathagata and Mondal, Sudipa. arXiv:2605.26771v2, 2026.

Studies local invariants and lower bounds on non-CM Galois orbit counts. The introduction records the still-conjectural fixed-level picture; the paper does not settle Maeda’s conjecture.

Status and links

Status: Preprint; version 2, 20 June 2026 · checked 2026-11-12

Cited in: Hecke polynomials and Maeda’s conjecture

269
Paper2013Wiese2013Maeda

An application of Maeda’s conjecture to the inverse Galois problem

Wiese, Gabor. Mathematical Research Letters, 20(5), 985–993, 2013.

Shows, conditionally on Maeda’s conjecture, that PSL_2(F_(p^r)) occurs over Q ramified only at p, for each positive even r and a density-one set of primes p.

Status and links

Status: Published article; Theorem 1.1(a) verified · checked 2026-11-12

Cited in: Hecke polynomials and Maeda’s conjecture

270
Paper2022Gonzalez2022

Irreducibility of the zero polynomials of Eisenstein series

González, Oscar E. Archiv der Mathematik, 119, 351–358, 2022.

Proves irreducibility for weights 12·2^ℓ by coefficient-valuation estimates and Dumas’ criterion. The full all-weight conjecture remains distinct from this infinite subfamily.

Status and links

Status: Published article; theorem checked in arXiv v1 · checked 2026-11-12

Cited in: Zero polynomials of Eisenstein series

271
Preprint2026ChiriacJorza2026

Lacunary recurrences and 2-adic properties of Eisenstein series

Chiriac, Liubomir and Jorza, Andrei. arXiv:2605.09738v2, 2026.

Reports a proof of González’s minimal 2-adic coefficient-valuation conjecture. This is a related advance, not a proof of the general irreducibility conjecture for Eisenstein zero polynomials.

Status and links

Status: Preprint; version 2, 2 June 2026 · checked 2026-11-12

Cited in: Zero polynomials of Eisenstein series

272
Preprint2026BrowningGundlachSawin2026Matrices

Counting matrices with given characteristic polynomial

Browning, Tim and Gundlach, Fabian and Sawin, Will. arXiv:2610.18226v1, 2026.

Studies integer matrices with a prescribed monic characteristic polynomial. The abstract reports a bound uniform in the polynomial and improving earlier bounds for matrix size at least four. The full paper was not retrievable in this review; no exact bound is asserted here.

Status and links

Status: Preprint; submitted 13 October 2026; abstract and primary bibliographic records verified · checked 2026-11-12

Cited in: Not cited in an article.

273
Paper2015Hindes2015IterationCurves

The arithmetic of curves defined by iteration

Hindes, Wade. Acta Arithmetica, 169(1), 1–27, 2015.

Relates quadratic-iterate Galois groups to rational points on curves. The final discussion asks a uniform finite-level maximality question, including the proposed level-four bound.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Composition and iteration · Arboreal Galois groups

274
Paper2002AdelbergFilaseta2002

On mth order Bernoulli polynomials of degree m that are Eisenstein

Adelberg, Arnold and Filaseta, Michael. Colloquium Mathematicum, 93(1), 21–26, 2002.

Proves a positive lower density greater than one-fifth of Eisenstein diagonal Bernoulli polynomials. Page 22 states Adelberg’s conjecture for even n and the quotient by x−n/2 for odd n.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Bernoulli and Euler polynomials

275
Paper1998Adelberg1998Newton

Higher Order Bernoulli Polynomials and Newton Polygons

Adelberg, Arnold. Applications of Fibonacci Numbers, Volume 7, Kluwer Academic Publishers, 1–8, 1998.

Studies higher-order Bernoulli factorization through Newton polygons. Original source of the diagonal irreducibility conjecture, restated by Adelberg–Filaseta in 2002.

Status and links

Status: Published article · checked 2026-11-12

Publisher metadata checked. The full chapter was not available; the conjecture was checked in the later primary article by Adelberg–Filaseta.

Cited in: Bernoulli and Euler polynomials

276
Paper2024FilasetaLuckner2024Euler

On nth order Euler polynomials of degree n that are Eisenstein

Filaseta, Michael and Luckner, Thomas. Indagationes Mathematicae, 35(1), 76–86, 2024.

Gives an exact odd-prime Eisenstein criterion for diagonal higher-order Euler polynomials and lower density at least (log 2)/2. The introduction states that the same argument improves the diagonal Bernoulli lower bound to (log 2)/2. These are order-n families, not ordinary Appell polynomials.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Bernoulli and Euler polynomials

277
Paper2026FelderVeselovNekrasov2026

Harmonic Locus and Calogero-Moser Spaces

Felder, Giovanni and Veselov, Alexander P. and Nekrasov, Nikita. Communications in Mathematical Physics, 407(2), Article 22, 2026.

Relates Hermite Wronskians and harmonic locus potentials to fixed points in Calogero–Moser space. Section 5 explicitly retains the conjecture that only the zero at the origin may be multiple. The spectral results for simple locus potentials do not resolve this conjecture.

Status and links

Status: Published work · checked 2026-11-12

Publisher records publication on 12 January 2026, volume 407, article 22; 22 is an article number, not a page range.

Cited in: Hermite, Bessel, and Legendre polynomials

278
Paper2000Zarhin2000Hyperelliptic

Hyperelliptic Jacobians without complex multiplication

Zarhin, Yuri G. Mathematical Research Letters, 7(1), 123–132, 2000.

Shows that a characteristic-zero hyperelliptic Jacobian has geometric endomorphism ring Z when its defining polynomial has degree at least five and Galois group S_n or A_n. Connects polynomial group computations to absolute simplicity; positive characteristic requires a supersingular alternative.

Status and links

Status: Published article; theorem locator refers to arXiv v2 · checked 2026-11-12

Cited in: Transitivity, primitivity, and cycle criteria · Kaneko–Zagier polynomials

279
Paper2026Zarhin2026Superelliptic

Superelliptic Jacobians and central simple representations

Zarhin, Yuri G. In Bruin, Nils and Kohel, David and Martindale, Chloe (editors), Arithmetic, Geometry, Cryptography and Coding Theory, American Mathematical Society, Contemporary Mathematics, 832, 175–209, 2026.

Determines geometric endomorphism rings of superelliptic Jacobians from permutation-group representations. For S_n or A_n and odd prime exponent, the ring is cyclotomic. The revised proof repairs an earlier representation-theoretic gap for degree five and primes greater than five; it also treats more general doubly transitive groups under additional hypotheses.

Status and links

Status: Published chapter (2026); theorem locators refer to arXiv v4 (2024) · checked 2026-11-12

Cited in: Transitivity, primitivity, and cycle criteria

280
Paper2010GuardiaMontesNart2010Okutsu

Okutsu invariants and Newton polygons

Guàrdia, Jordi and Montes, Jesús and Nart, Enric. Acta Arithmetica, 145(1), 83–108, 2010.

Relates Okutsu frames to higher Newton polygons and complete types. Explains how local factorization computes invariants and polynomial approximations to irreducible factors. The tame case gives an isomorphism of the extensions defined by an irreducible polynomial and an Okutsu approximation; this conclusion is not asserted in general for wild ramification.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial factorization algorithms

281
Preprint2026NguyenDang2026Taylor

Galois groups of Taylor polynomials: prescriptions and arithmetic families

Nguyen-Dang, Khai-Hoan. Hexagon preprint, 2026.

Version 3 states an arbitrary symmetric-degree prescription, counterexamples to the two universal Katz–Rivin assertions, uniform arithmetic multiplier results, a number-field extension of Wei’s binomial classification, and all-degree central-binomial and Catalan groups. Theorem A concerns unrestricted coefficient constructions; Theorems B–E impose specific arithmetic families. Full proofs have not been independently verified here.

Status and links

Status: Preprint claim; version 3 (October 2026); no peer-reviewed publication verified · checked 2026-11-12

Cited in: Taylor polynomials · Taylor polynomials and Katz–Rivin questions

282
Preprint2026Seki2026Catalan

Irreducibility of truncations of the Catalan generating function

Seki, Shin-ichiro. arXiv preprint, 2026.

Theorem 1.1 states rational irreducibility of every nonconstant Catalan section. The proof combines root bounds, prime products, and a functional equation forced on a hypothetical factor. The paper explicitly leaves Sun’s stronger full symmetric-group conjecture untreated.

Status and links

Status: Preprint; version 1, 9 September 2026; no peer-reviewed publication verified · checked 2026-11-12

Cited in: Taylor polynomials and Katz–Rivin questions

283
Resource2013Sun2013CatalanGroups

A224416: least prime giving an irreducible reduction of a reversed Catalan section

Sun, Zhi-Wei. The On-Line Encyclopedia of Integer Sequences, 2013.

Comments (i)–(iii) formulate Catalan symmetric-group and least-prime conjectures, the exceptional-degree criterion for reversed central-binomial sections, and a central-trinomial analogue. The least-prime bounds are separate from the corresponding Galois-group assertions.

Status and links

Status: Source of conjectures; entry created 6 April 2013 · checked 2026-11-12

Cited in: Taylor polynomials and Katz–Rivin questions

284
Paper2017JonesLevy2017Eventual

Eventually stable rational functions

Jones, Rafe and Levy, Alon. International Journal of Number Theory, 13(9), 2299–2318, 2017.

Theorem 1.3 gives eventual stability from good reduction to a purely inseparable map followed by a fractional linear map over a finite residue field. Corollary 1.5 covers x²+1/a for odd a≠−1. The general nonperiodic-point conjecture must be read with the counterexample recorded below.

Status and links

Status: Published work · checked 2026-11-12

Cited in: Composition and iteration · Irreducibility of iterates

285
Paper2015HamblenJonesMadhu2015

The density of primes in orbits of z^d+c

Hamblen, Spencer and Jones, Rafe and Madhu, Kalyani. International Mathematics Research Notices, 2015(7), 1924–1958, 2015.

Combines irreducibility criteria, ramification in iterated extensions, and Galois processes to study prime divisors of orbits. In particular, z^d+c over Q is eventually stable when c≠0 is not the reciprocal of an integer. This factorization theorem is distinct from the density conclusions, which have further hypotheses.

Status and links

Status: Published work · checked 2026-11-12

Cited in: Irreducibility of iterates

286
Preprint2026TuckerZhu2026Counterexample

A Counterexample to the Eventual Stability Conjecture

Tucker, Thomas J. and Zhu, Zheng. arXiv:2610.28688 [math.NT], 2026.

Gives a counterexample to the original nonperiodic-target eventual-stability conjecture and classifies eventual stability for power maps. Theorem 1.2 shows that x^(6^n)+1 has exactly n+1 irreducible factors over Q. The counterexample and its elementary cyclotomic proof were checked against the full text.

Status and links

Status: Preprint; statement and counterexample checked · checked 2026-11-12

Submitted 20 October 2026. Full HTML retrieved and Theorems 1.2 and 2.1 read. The atlas presents the elementary counterexample, not the full classification.

Cited in: Irreducibility of iterates

287
Paper2014BuffTan2014Dynatomic

The quadratic dynatomic curves are smooth and irreducible

Buff, Xavier and Tan, Lei. Frontiers in Complex Dynamics: In Celebration of John Milnor's 80th Birthday, Princeton University Press, 49–72, 2014.

Reproves smoothness (Douady–Hubbard) and irreducibility (Bousch; Lau–Schleicher) of the quadratic dynatomic curves. Theorems 1.1–1.2 concern curves in the two variables c and z. The proofs use quadratic differentials and kneading sequences; they do not settle irreducibility of critical-parameter polynomials over Q.

Status and links

Status: Published work · checked 2026-11-12

Publisher chapter gives pp. 49–72; the author-hosted preprint is dated 22 January 2012. Publisher metadata truncates Buff in one display, corrected from the paper itself.

Cited in: Gleason and Misiurewicz polynomials

288
Paper2018Krumm2018DynatomicFour

Galois groups in a family of dynatomic polynomials

Krumm, David. Journal of Number Theory, 187, 469–511, 2018.

Determines the Galois group and irreducible factor degrees of the fourth dynatomic polynomial for every quadratic polynomial over Q. This explicit classification complements the later finiteness theorem for larger periods.

Status and links

Status: Published work · checked 2026-11-12

Cited in: Specialization and Hilbert irreducibility

289
Paper2020DoylePoonen2020Gonality

Gonality of dynatomic curves and strong uniform boundedness of preperiodic points

Doyle, John R. and Poonen, Bjorn. Compositio Mathematica, 156(4), 733–743, 2020.

For z^d+c, proves geometric irreducibility of the irreducible components of preperiodic-point curves when the base field contains the d-th roots of unity and its characteristic does not divide d. Their gonalities grow without bound. Theorems 1.7–1.8 give uniform bounds over function fields (with a nonconstant-parameter condition when the constant field is infinite) and for bounded eventual period over number fields of bounded degree.

Status and links

Status: Published work · checked 2026-11-12

Cited in: Gleason and Misiurewicz polynomials

290
Paper1987LenstraSchoof1987PrimitiveNormal

Primitive normal bases for finite fields

Lenstra, Hendrik W., Jr. and Schoof, René J. Mathematics of Computation, 48(177), 217–231, 1987.

Proves that every finite extension of a finite field has a normal basis generated by a primitive element. The argument combines the Frobenius module structure with character sums and a finite verification. Normality is an additional additive condition, not a consequence of irreducibility or multiplicative primitivity.

Status and links

Status: Published work · checked 2026-11-12

Cited in: Irreducible polynomials with coefficient restrictions · Primitive and normal elements

291
Paper2003CohenHuczynska2003PrimitiveNormal

The primitive normal basis theorem—without a computer

Cohen, Stephen D. and Huczynska, Sophie. Journal of the London Mathematical Society, 67(1), 41–56, 2003.

Gives a computer-free proof of the primitive normal basis theorem. A useful companion to Lenstra–Schoof for studying character-sum estimates and sieving methods behind simultaneous multiplicative and additive conditions.

Status and links

Status: Published work · checked 2026-11-12

Cited in: Primitive and normal elements

292
Paper2008CohenPresern2008Primitive

The Hansen-Mullen primitivity conjecture: completion of proof

Cohen, Stephen D. and Prešern, Mateja. Number Theory and Polynomials, Cambridge University Press, London Mathematical Society Lecture Note Series, 352, 89–120, 2008.

Completes the primitive-polynomial coefficient-prescription conjecture by treating the remaining degrees 5–8. The proof uses p-adic and sieve methods. Primitive-polynomial prescriptions have different exceptions and multiplicative constraints from the irreducible-polynomial theorem.

Status and links

Status: Published work · checked 2026-11-12

Print publication is 2008; the publisher posted the chapter online on 4 May 2010.

Cited in: Irreducible polynomials with coefficient restrictions

293
Paper1996MorganMullen1996CompletelyNormal

Completely normal primitive basis generators of finite fields

Morgan, Ilene H. and Mullen, Gary L. Utilitas Mathematica, 49, 21–43, 1996.

Introduces the conjecture that every finite-field extension contains a primitive completely normal element, supported by explicit constructions. Complete normality requires normality over each intermediate field. Consult the later published bounds and the separately labeled 2026 claimed resolution for present status.

Status and links

Status: Published work · checked 2026-11-12

Cited in: Irreducible polynomials with coefficient restrictions · Primitive and normal elements

294
Paper2019GarefalakisKapetanakis2019PCN

On the existence of primitive completely normal bases of finite fields

Garefalakis, Theodoulos and Kapetanakis, Giorgos. Journal of Pure and Applied Algebra, 223(3), 909–921, 2019.

Proves the Morgan–Mullen assertion when n=p^a m, p is the characteristic, gcd(m,p)=1, and q>m. In particular this covers n≤q. The method estimates completely normal elements and combines these estimates with multiplicative character sums.

Status and links

Status: Published work · checked 2026-11-12

Cited in: Primitive and normal elements

295
Paper2026GarefalakisKapetanakis2026Translates

Translates of completely normal elements and the Morgan–Mullen conjecture

Garefalakis, Theodoulos and Kapetanakis, Giorgos. Canadian Mathematical Bulletin, 1–21, 2026.

Constructs sets of completely normal elements and proves further primitive-complete-normal existence results. Theorems 4.10, 5.2–5.3, 6.4, and 7.2 develop the translate method; §2 summarizes previously proved ranges. The paper predates Hellwig’s October 2026 claim.

Status and links

Status: Published work · checked 2026-11-12

First View article published online 28 May 2026; no final volume or issue asserted.

Cited in: Primitive and normal elements

296
Preprint2026Hellwig2026MorganMullen

Resolvent Components of Completely Normal Elements and the Morgan-Mullen Conjecture

Hellwig, Florian. arXiv:2610.36534 [math.NT], 2026.

Theorem 1.2 claims a proof of Morgan–Mullen via partial Lagrange resolvents, character sums, and finite computations. Section 1.3 and Appendix A describe a Lean formalization using the known n≤q theorem and a Rosser–Schoenfeld bound as axioms, with compiled computations. The theorem and verification scope were read; the proof and code were not independently audited.

Status and links

Status: Preprint claim; statement checked · checked 2026-11-12

Submitted 27 October 2026. Full HTML retrieved; Theorem 1.2, §1.3, and Appendix A checked. No independent mathematical or code verification is claimed.

Cited in: Irreducible polynomials with coefficient restrictions · Primitive and normal elements

297
Paper2019KoenigLegrandNeftin2019Local

On the local behavior of specializations of function field extensions

König, Joachim and Legrand, François and Neftin, Danny. International Mathematics Research Notices, 2019(9), 2951–2980, 2019.

Extends Beckmann’s specialization analysis from inertia to decomposition groups. Theorem 1.1 determines a specialized decomposition group from the branch-point residue extension when the intersection multiplicity is coprime to the branch inertia order, outside a finite set of primes. Applications include Grunwald problems and obstructions to parametricity.

Status and links

Status: Published work · checked 2026-11-12

Cited in: Specialization and Hilbert irreducibility

298
Paper2021DieulefaitPacettiTsaknias2021

On the number of Galois orbits of newforms

Dieulefait, Luis Victor and Pacetti, Ariel and Tsaknias, Panagiotis. Journal of the European Mathematical Society, 23(8), 2833–2860, 2021.

Theorem 4.3 gives eventual lower bounds from local types and minimal Atkin–Lehner signs. Remark 4.4 explains why general multiplicativity is not expected; Example 4.7 records an unexplained level-256 discrepancy.

Status and links

Status: Published · checked 2026-11-12

Cited in: Hecke polynomials and Maeda’s conjecture

299
Paper2022EllisMonaghanEtAl2022EmbeddedTutte

Irreducibility of the Tutte polynomial of an embedded graph

Ellis-Monaghan, Joanna A. and Goodall, Andrew J. and Moffatt, Iain and Noble, Steven D. and Vena, Lluís. Algebraic Combinatorics, 5(6), 1337–1351, 2022.

Extends Tutte irreducibility to orientable embedded graphs and, more generally, even delta-matroids. Theorems 1.1–1.2 characterize irreducibility by the appropriate notion of connectedness; no full Galois-group assertion follows.

Status and links

Status: Published · checked 2026-11-12

Cited in: Tutte polynomials

300
Paper2017DilcherKidwaiTomkins2017Stern

Zeros and irreducibility of Stern polynomials

Dilcher, Karl and Kidwai, Mohammad and Tomkins, Hayley. Publicationes Mathematicae Debrecen, 90(3--4), 407–433, 2017.

Uses root bounds and a prime-value criterion for the Klavžar–Milutinović–Petr Stern sequence. Conjecture 3.1 concerns a half-plane; Conjectures 3.15 and 6.1 concern unimodality. Prime-index irreducibility is subsequently proved in Altizio’s 2025 preprint.

Status and links

Status: Published · checked 2026-11-12

Cited in: Stern polynomials

301
Paper2021DilcherEricksen2021SternCoefficients

Polynomials Whose Coefficients Are Stern Numbers

Dilcher, Karl and Ericksen, Larry. Journal of Integer Sequences, 24, Article 21.10.3, 2021.

Studies a third construction: polynomials with consecutive Stern numbers as coefficients. Proposition 21 characterizes certain cyclotomic divisors through sums in residue classes. Section 5.3 gives reducible examples; this family differs from both recurrence-defined Stern sequences.

Status and links

Status: Published · checked 2026-11-12

Cited in: Stern polynomials

302
Paper2022FlorezSaunders2022Fibonacci

Irreducibility of Generalized Fibonacci Polynomials

Flórez, Rigoberto and Saunders, J. C. Integers, 22, A69, 2022.

Studies second-order Fibonacci- and Lucas-type recurrences. Under the paper’s coprimality and degree hypotheses, Theorem 9 reduces prime-index irreducibility to a polynomial over a cyclotomic real subfield. These are different from the polynomial x^n-x^(n-1)-...-1 studied by Martin.

Status and links

Status: Published · checked 2026-11-12

Published 3 August 2022. Zenodo record 10991876 is the journal’s archived copy, not a separate paper.

Cited in: Not cited in an article.

303
Paper2022Hyde2022Necklace

Cyclotomic factors of necklace polynomials

Hyde, Trevor. Acta Arithmetica, 204(4), 287–316, 2022.

Describes cyclotomic factors of necklace polynomials and shifted cyclotomic polynomials using Dirichlet characters and necklace operators. Theorem 1.1 gives a sufficient character-covering condition for common factors.

Status and links

Status: Published · checked 2026-11-12

Cited in: Fekete polynomials

304
Preprint2026MinhEtAl2026RationalNecklace

Cyclotomic factors of rational necklace functions

Nguyen Cao Minh and Nguyen Vu Hoang Minh and Dung Nguyen and Tung T. Nguyen and Nguyen Duy Tan and Duong Tran. arXiv:2606.02324v1, 2026.

Extends necklace operators to rational functions, including principal-character Fekete polynomials. Theorem 2.7 gives a residue-class cancellation criterion; Theorem 4.5 gives further cyclotomic factors using fixed fields.

Status and links

Status: Preprint · checked 2026-11-12

Version 1, 1 June 2026; no later version or journal publication shown in the arXiv record checked 12 November 2026.

Cited in: Fekete polynomials

305
Paper2021GriffinEtAl2021Monomials

Monomials of Eisenstein series

Griffin, Trevor and Kenshur, Nathan and Price, Abigail and Vandenberg-Daves, Bradshaw and Xue, Hui and Zhu, Daozhou. Journal of Number Theory, 219, 445–459, 2021.

Classifies multiplicative identities among normalized level-one Eisenstein series. Conjecture 3.1 asks whether distinct Eisenstein zero polynomials are relatively prime; the authors note that the irreducibility conjecture would imply this.

Status and links

Status: Published · checked 2026-11-12

Cited in: Zero polynomials of Eisenstein series

306
Paper2018JindalLaishramSarma2018

Irreducibility and Galois groups of generalized Laguerre polynomials L_n^(-1-n-r)(x)

Jindal, Ankita and Laishram, Shanta and Sarma, Ritumoni. Journal of Number Theory, 183, 388–406, 2018.

Proves irreducibility and alternating-group containment throughout 0≤r≤60 and gives an explicit eventual-degree bound. The article appeared in 2018; the arXiv copy was deposited in 2019. Its Laguerre convention includes an additional factor (−1)^n.

Status and links

Status: Published · checked 2026-11-12

Cited in: Laguerre polynomials with negative parameters

307
Paper2022CullinanScheel2022

On the arithmetic of Padé approximants to the exponential function

Cullinan, John and Scheel, Nick. Journal of the Ramanujan Mathematical Society, 37(3), 207–219, 2022.

Identifies exponential Padé numerators and denominators with negative-integral Laguerre polynomials. Determines near-diagonal groups conditional on irreducibility and proves special irreducible cases by Newton polygons.

Status and links

Status: Published · checked 2026-11-12

Cited in: Laguerre polynomials with negative parameters

308
Preprint2026CullinanHajirYoung2026

Hasse-Witt invariants for trace forms of Jacobi polynomials

Cullinan, John and Hajir, Farshid and Young, Elisabeth. arXiv preprint, 2026.

Develops Jacobi power-sum minor formulas using Hankel determinants and continued fractions, with applications to trace-form invariants and central double-cover embedding problems. The displayed v1 Theorem 6 formula has a D_0 normalization discrepancy; the atlas records it and does not use that diagonal formula. No universal Jacobi irreducibility theorem is claimed.

Status and links

Status: Preprint; version 1, 12 August 2026; author lists it as submitted; no journal publication verified · checked 2026-11-15

Cited in: Hermite, Bessel, and Legendre polynomials

309
Paper2020BanerjeeBera2020Grosswald

On a generalization of a conjecture of Grosswald

Banerjee, Pradipto and Bera, Ranjan. Journal of Number Theory, 216, 216–241, 2020.

Studies generalized Bessel polynomials, irreducibility, and large Galois groups. Must be read with the authors’ 2021 corrigendum (10.1016/j.jnt.2020.11.002). The publisher abstract and bibliographic record were checked; detailed parameter-dependent statements are not reproduced here.

Status and links

Status: Published; corrigendum published in 2021 · checked 2026-11-12

Companion correction: BanerjeeBera2021GrosswaldCorrection.

Cited in: Hermite, Bessel, and Legendre polynomials

310
Paper2021BanerjeeBera2021GrosswaldCorrection

Corrigendum to “On a generalization of a conjecture of Grosswald” [J. Number Theory 216 (2020) 216–241]

Banerjee, Pradipto and Bera, Ranjan. Journal of Number Theory, 222, 426–428, 2021.

Published correction to the generalized-Bessel paper. Bibliographic details were confirmed against the authors’ institution and publisher-deposited Crossref metadata; the full correction was not accessed.

Status and links

Status: Published corrigendum · checked 2026-11-12

Read together with BanerjeeBera2020Grosswald.

Cited in: Hermite, Bessel, and Legendre polynomials

311
Paper1962McCarthy1962

Irreducibility of Bernoulli polynomials of higher order

McCarthy, P. J. Canadian Journal of Mathematics, 14, 565–567, 1962.

Proves irreducibility in prime-power degree families for every fixed positive order, including B_(2^t)^(k) for t≥k. The full scan was checked; the original year is 1962, not the online digitization date 2018.

Status and links

Status: Published · checked 2026-11-12

Cited in: Bernoulli and Euler polynomials

312
Paper2026Hokken2026ReciprocalSquare

Counting (skew-)reciprocal Littlewood polynomials with square discriminant

Hokken, David. Israel Journal of Mathematics, 2026.

Counts square discriminants in reciprocal and skew-reciprocal Littlewood families. For degrees congruent to 0 or 6 modulo 8, their probability has order (log n)/sqrt(n). The proof uses binomial sums and weighted counts of Pythagorean triples. This is not a result for the full independent-coefficient ensemble.

Status and links

Status: Published online 6 April 2026 · checked 2026-11-12

Theorem 1.1, Corollary 1.2 and §8 checked against the publisher PDF and arXiv v2 (10 June 2025). Published online 6 April 2026; publisher PDF retains volume TBD and provisional pages 1–33, so no final volume/pages asserted.

Cited in: Littlewood polynomials

313
Paper2026Hokken2026ZeroTopology

Topology of zero sets of polynomials with square discriminant

Hokken, David. Comptes Rendus. Mathématique, 364, 101–106, 2026.

Shows that imposing a square discriminant preserves the closure of the complex zero set for several coefficient alphabets. The general theorem permits zero discriminant; for Littlewood polynomials, the approximation can use separable reciprocal polynomials with square discriminant.

Status and links

Status: Published 9 March 2026 · checked 2026-11-12

Theorem 1 and Corollary 5 checked against publisher PDF and arXiv v1; publisher confirms volume364, pages101–106 and 9March2026 publication.

Cited in: Discriminants, parity, and ramification

314
Preprint2026AndersonEtAl2026StrongVdW

The strong form of Van der Waerden’s conjecture via twisted Chowla

Anderson, Theresa C. and Chow, Sam and Dietmann, Rainer and Hokken, David and Koymans, Peter and Lemke Oliver, Robert J. and Sawin, Will and Shusterman, Mark. arXiv, 2026.

Proves a power saving for monic irreducible polynomials of fixed degree n≥40 with non-symmetric Galois group. The method combines a square sieve, differencing and twisted Möbius correlations over finite fields.

Status and links

Status: Preprint; version 2 dated 21 September 2026 · checked 2026-11-12

Full primary HTML retrieved directly from arXiv after search-tool retrieval failed. Definition 1.3, Theorems 1.2, 1.4, 1.5, Conjecture 1.6 and Theorem 6.3 read. Version 1 has only six authors and a conditional degree≥7 statement; do not mix the versions.

Cited in: Height bounds for exceptional Galois groups

315
Preprint2025AndersonEtAl2025DoubleDiscriminant

The structure of the double discriminant

Anderson, Theresa C. and Asarhasa, Ufuoma V. and Bertelli, Adam and Gundlach, Fabian and O’Dorney, Evan M. arXiv, 2025.

Factors the discriminant of the generic polynomial discriminant with respect to one coefficient into a cube, a square and possible endpoint factors. The factors describe triple roots and pairs of double roots. This gives explicit algebraic structure to an object used in Bhargava’s counting argument.

Status and links

Status: Preprint; version 2 dated 24 November 2025 · checked 2026-11-12

Theorems 1.1, 3.1, 3.4 and 3.11; Conjectures 1.4 and 4.1. Do not describe all conjectures as resolved because the v2 abstract says that some results conjectured in v1 were proved.

Cited in: Discriminants, parity, and ramification

316
Preprint2026ArangoPinerosEtAl2026SmallestPolynomial

Counting number fields of fixed degree by their smallest defining polynomial

Arango-Piñeros, Santiago and Gundlach, Fabian and Lemke Oliver, Robert J. and McGown, Kevin J. and Sawin, Will and Serrano López, Allechar and Shankar, Arul and Varma, Ila. arXiv, 2026.

Counts isomorphism classes of number fields by the smallest coefficient height of any integral defining polynomial, without a monicity condition. The asymptotic is C_n X^(n+1) for n≥3 and (27/π²)X² for n=2. A second theorem controls when two small polynomials define the same field.

Status and links

Status: Preprint; version 1 dated 6 February 2026 · checked 2026-11-12

Theorems 1.1 and 1.2, and the definition of P¹-height in §1, checked in full primary HTML. This counts fields by a minimal polynomial height, not fields by discriminant or all coefficient vectors.

Cited in: Height bounds for exceptional Galois groups

317
Paper2026ChowDietmann2026NumberFields

Enumerative Galois theory for number fields

Chow, Sam and Dietmann, Rainer. Mathematika, 2026.

Uses the determinant method to bound degree-n number fields of bounded discriminant whose Galois closure has a prescribed transitive group inside A_n. The accepted version treats three specific improvements and explains a later improvement for one of them. This is field counting, rather than polynomial coefficient-box counting.

Status and links

Status: Accepted; Mathematika, to appear · checked 2026-11-12

Accepted 3 April 2026; arXiv v2 has the same date. Theorem 1.8 and Remark 1.9 checked. The v1 abstract refers to four cases; the accepted v2 discusses three, including a subsequently improved 6T12 case. No publisher DOI, volume or pages verified.

Cited in: Height bounds for exceptional Galois groups

318
Preprint2026Wei2026JacobiPrimeWitnesses

Prime Witnesses and Eventual Alternating–Symmetric Galois Groups in a Jacobi Family

Wei, Dongsheng. Zenodo, 2026.

For each fixed nonintegral rational parameter, proves an effective eventual alternating-or-symmetric classification for the binomial Jacobi family. It also proves irreducibility in every degree for central-binomial partial sums. The method combines prime witnesses, Newton polygons, tame inertia and primitive permutation groups.

Status and links

Status: Preprint; second deposited version, 3 October 2026 · checked 2026-11-12

Primary Zenodo API and full PDF read. PDF dated 1 October 2026; deposit date 3 October 2026. This is version 2 under concept DOI10.5281/zenodo.22057088, replacing record22057089 (22 August2026). Theorems A–D, Proposition2.1, Corollary9.4 and Remark9.6. Supplement supplies a claimed Lean formalization of Theorem B(i); not independently built in this audit.

Cited in: Taylor polynomials and Katz–Rivin questions

319
Paper1999Lenstra1999Lacunary

Finding small degree factors of lacunary polynomials

Lenstra, Jr., Hendrik W. In Györy, Kálmán and Iwaniec, Henryk and Urbanowicz, Jerzy (editors), Number Theory in Progress, Vol. 1, De Gruyter, 267–276, 1999.

Finds bounded-degree factors of sparse univariate polynomials over number fields in time polynomial in sparse input length and the degree bound.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Factoring sparse polynomials

320
Paper2020BhargavaSarafVolkovich2020

Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree

Bhargava, Vishwas and Saraf, Shubhangi and Volkovich, Ilya. Journal of the ACM, 67(2), Article 8, 1–28, 2020.

Bounds the sparsity of factors using Newton polytopes and obtains deterministic quasipolynomial factorization for bounded individual degree.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Factoring sparse polynomials

321
Paper2026ChuyoonShpilka2026

On Factorization of Sparse Polynomials of Bounded Individual Degree

Chuyoon, Aminadav and Shpilka, Amir. 41st Computational Complexity Conference (CCC 2026), LIPIcs 383, 20:1–20:20, 2026.

Deterministic algorithms for all sparse divisors and full factorization of sparse polynomials with bounded individual degree. Published Theorems 9 and 12 give the stated complexity bounds; Remark 7 separates field and bit costs. The longer arXiv manuscript, §10, asks for a faster irreducibility test.

Status and links

Status: Published conference paper; 23 July 2026 · checked 2026-11-12

Conference publication and Theorems 9 and 12 checked against the publisher PDF on 12 November 2026; full-manuscript §10 checked directly. This record replaces the previous preprint-only record; the citation key is retained.

Cited in: Factoring sparse polynomials

322
Preprint2026BhattacharjeeKotharyRaiSaraf2026

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials

Bhattacharjee, Somnath and Kothary, Rishabh and Rai, Shanthanu S. and Saraf, Shubhangi. Electronic Colloquium on Computational Complexity, Report TR26-105, 2026.

Constructs short lists containing all bounded-individual-degree factors; extra candidates must still be removed by divisibility testing.

Status and links

Status: Preprint; ECCC report of 25 June 2026 checked · checked 2026-11-12

Cited in: Factoring sparse polynomials

323
Paper2023FiekerSutherland2023

Computing splitting fields using Galois theory and other Galois constructions

Fieker, Claus and Sutherland, Nicole. Journal of Symbolic Computation, 116, 243–262, 2023.

Uses computed permutation groups and relative invariants to construct fixed fields, splitting fields, and geometric Galois groups.

Status and links

Status: Published article · checked 2026-11-12

The arXiv manuscript is titled Constructions using Galois Theory; theorem locators refer to version 3, 27 October 2022.

Cited in: Specialization and Hilbert irreducibility · Algorithms for Galois groups

324
Paper2021KrummSutherland2021

Galois groups over rational function fields and explicit Hilbert irreducibility

Krumm, David and Sutherland, Nicole. Journal of Symbolic Computation, 103, 108–126, 2021.

Describes group-dropping specializations through rational points on fixed-field curves and determines exceptions in explicit examples.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Specialization and Hilbert irreducibility · Exceptional specializations

325
Paper2020KoleyReddy2020Criterion

An irreducibility criterion for polynomials over integers

Koley, Biswajit and Reddy, A. Satyanarayana. Bulletin Mathématique de la Société des Sciences Mathématiques de Roumanie, 63(111)(1), 83–89, 2020.

At a prime constant-term boundary, identifies the cyclotomic part by a binomial gcd and proves irreducibility of the remaining nonreciprocal part.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Root bounds and prime-value criteria

326
Paper2022FiekerHofmannJoswig2022

Computing Galois Groups of Ehrhart Polynomials in OSCAR

Fieker, Claus and Hofmann, Tommy and Joswig, Michael. Séminaire Lotharingien de Combinatoire, 86B, Article 87, 1–9, 2022.

Explains subgroup-descent computations in OSCAR and asks which finite groups occur for Ehrhart polynomials, including whether every cyclic group occurs.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Ehrhart polynomials

327
Preprint2026HendersonJuulLattinMercadoSchaefer2026

Examples of Quadratic Polynomials over Q with Surjective Arboreal Galois Representations

Henderson, Luck and Juul, Jamie and Lattin, Brenner and Mercado, Enrique and Schaefer, Mia. arXiv preprint, 2026.

Gives explicit sufficient conditions for surjectivity for pairs (x²+c, a) with a rational strictly preperiodic target a. Theorems 1–2 concern the preimage equations fⁿ(x)−a, rather than always the target 0. Example 3 includes c=−13/16 and a=1/4.

Status and links

Status: Preprint; version 1, 26 March 2026 · checked 2026-11-12

Theorem 2(1) and Example 3 checked in the full version-1 text; author research page lists the work as submitted.

Cited in: Composition and iteration · Arboreal Galois groups

328
Paper1990VonZurGathen1990Tame

Functional Decomposition of Polynomials: The Tame Case

von zur Gathen, Joachim. Journal of Symbolic Computation, 9(3), 281–299, 1990.

Algorithms for deciding and computing polynomial decompositions when the characteristic does not divide the proposed outer degree. Normalization gives uniqueness for the fixed degree pattern; the paper also treats multivariate input.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial decomposition

329
Paper1990VonZurGathen1990Wild

Functional Decomposition of Polynomials: The Wild Case

von zur Gathen, Joachim. Journal of Symbolic Computation, 10(5), 437–452, 1990.

Studies decomposition when the characteristic divides the outer degree, where the tame coefficient-recovery method fails. Gives a polynomial-time partial algorithm, including cases in which the square of the characteristic does not divide that degree.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial decomposition

330
Paper2008Jones2008PrimeDivisors

The density of prime divisors in the arithmetic dynamics of quadratic polynomials

Jones, Rafe. Journal of the London Mathematical Society, 78(2), 523–544, 2008.

Uses Galois groups, fixed-point proportions, and probability to prove zero-density results for prime divisors of several families of integral quadratic orbits. Also supplies criteria for irreducibility of iterates; the Galois applications motivate control of the critical orbit.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Arboreal Galois groups

331
Book2007Silverman2007Dynamics

The Arithmetic of Dynamical Systems

Silverman, Joseph H. Graduate Texts in Mathematics 241, Springer, vol. 241, x+511, 2007.

Graduate text on arithmetic dynamics: critical points, local reduction, heights, periodic points, dynatomic polynomials, and moduli spaces. Sections 3.9 and 4.1–4.2 connect Galois groups and the geometry of periodic-point curves. The author supplies a contents file, bibliography, and errata.

Status and links

Status: Published book · checked 2026-11-12

Cited in: Composition and iteration

332
Notes2026Jones2026HistoricalOdyssey

2007: An Arboreal Odyssey: A View of Arboreal Galois Representations and Applications, from Early in the Subject’s History

Jones, Rafe. arXiv historical survey manuscript, 2026.

A survey written in 2007 and posted unchanged in 2026. Explains early motivations from prime divisors of recurrences, periodic-point densities, and comparisons with linear Galois representations. Its problem status is historical, not an update through 2026.

Status and links

Status: Historical manuscript written in 2007; posted 20 May 2026 · checked 2026-11-12

The abstract explicitly says the article is reproduced exactly as written in 2007 and was not intended for publication.

Cited in: Composition and iteration

333
Paper2020Kadets2020LargeArboreal

Large arboreal Galois representations

Kadets, Borys. Journal of Number Theory, 210, 416–430, 2020.

For even degree, combines symmetric Galois groups on all fibers with independence of iterated discriminant square classes to obtain a full arboreal image. Gives rational examples in every even degree d≥20 and criteria for iterated monodromy over function fields. The fiber-group assumptions in Theorem 1.2 cannot be omitted.

Status and links

Status: Published article · checked 2026-11-12

Theorems 1.2 and 1.4 checked in arXiv:1802.09074v3 (3 March 2020); final source has the d≥20 scope for even-degree rational examples.

Cited in: Arboreal Galois groups

334
NotesUndatedConradFiniteFields

Finite Fields

Conrad, Keith. Author-hosted expository notes.

A concise account of finite-field constructions, subfields, Frobenius conjugates, cyclic Galois groups, trace and norm. Theorems 5.1–5.7 state the results over a general finite ground field.

Status and links

Status: Expository notes; undated · checked 2026-11-12

Author PDF, 13 pages; no publication year assigned.

Cited in: Finite fields and Frobenius

335
Paper2010CohenHuczynska2010Strong

The strong primitive normal basis theorem

Cohen, Stephen D. and Huczynska, Sophie. Acta Arithmetica, 143(4), 299–332, 2010.

Proves that a finite extension F_(q^n)/F_q has a primitive normal element whose inverse is also normal over F_q, except for exactly five pairs (q,n): (2,3), (2,4), (3,4), (4,3), and (5,4). Section 2 develops the multiplicative and polynomial-module conditions used by the sieve.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Primitive and normal elements

336
Paper2021OliveiraReis2021Sparse

On polynomials x^n − 1 over binary fields whose irreducible factors are binomials and trinomials

Oliveira, Daniela and Reis, Lucas. Finite Fields and Their Applications, 73, 101837, 2021.

Studies when every irreducible factor of x^n−1 has at most three terms in characteristic two, and gives complete classifications over F_2 and F_4. This asks about all factors of a specified polynomial, rather than the existence of a sparse irreducible in every degree.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Sparse irreducible polynomials over finite fields

337
Paper2026Cheng2026SparseCharacteristicTwo

The 3-sparsity of X^n − 1 over finite fields of characteristic 2

Cheng, Kaimin. Transactions of the London Mathematical Society, 13(1), e70026, 2026.

Extends the classification of characteristic-two polynomials X^n−1 whose irreducible factors have at most three terms. The original exceptional family involving powers of seven is corrected in a published corrigendum and arXiv:2507.10779v2. Read with the correction.

Status and links

Status: Published article; corrigendum required · checked 2026-11-12

Published online 20 March 2026. Corrected author version: 24 April 2026; corrigendum published 8 July 2026.

Cited in: Sparse irreducible polynomials over finite fields

338
Paper2026Cheng2026SparseCorrigendum

Corrigendum: The 3-sparsity of X^n − 1 over finite fields of characteristic 2

Cheng, Kaimin. Transactions of the London Mathematical Society, 13(1), e70035, 2026.

Corrects the exceptional characteristic-two family in the earlier article. The corrected author version requires maximal Frobenius order modulo the relevant powers of seven and exhibits q=128,n=49 as a counterexample to the earlier statement.

Status and links

Status: Published corrigendum; corrected author version checked · checked 2026-11-12

The publisher contents page records publication on 8 July 2026. Mathematical details checked in the corrected arXiv version, Theorem 1.3, Proposition 3.4, and Example 5.2.

Cited in: Sparse irreducible polynomials over finite fields

339
Preprint2026ZhuWu2026CyclotomicTrinomials

Cyclotomic polynomials with trinomial irreducible factors over finite fields

Zhu, Li and Wu, Hongfeng. arXiv:2611.00647 [math.NT], 2026.

Claims a classification of pairs (q,n), n>1 and gcd(n,q)=1, for which every irreducible factor of Phi_n over F_q has exactly three nonzero terms. Uses common support divisors, power substitutions, and multiplicative orders. Its question concerns one cyclotomic polynomial, not all factors of X^n−1.

Status and links

Status: Preprint claim; version and statements checked · checked 2026-11-12

Version 2 submitted 3 November 2026. No journal publication verified; full proof not independently certified.

Cited in: Sparse irreducible polynomials over finite fields

340
NotesUndatedConradRootsIrreducibles

Roots and irreducibles

Conrad, Keith. Author-hosted expository notes.

Constructs extensions containing roots by quotienting a polynomial ring, proves the minimal-polynomial divisibility criterion, and develops Frobenius conjugacy over finite fields. Theorems 2.1, 3.1, and 5.4 connect irreducibility with extension fields and root orbits.

Status and links

Status: Expository notes; unpublished · checked 2026-11-12

Undated author notes. The author states that revised files may replace previous versions without a version history; locators were checked on 12 November 2026.

Cited in: Foundations: polynomials, fields, and Galois groups · Field extensions and minimal polynomials

341
NotesUndatedConradGaloisCorrespondence

The Galois correspondence

Conrad, Keith. Author-hosted expository notes.

Develops separability, normality, automorphisms, and the fundamental theorem with explicit splitting fields. Theorem 5.6 states the field–subgroup correspondence; Examples 4.6–4.7 and 5.8 treat cubic and quartic radical extensions.

Status and links

Status: Expository notes; unpublished · checked 2026-11-12

Undated author notes. The author states that revised files may replace previous versions without a version history; locators were checked on 12 November 2026.

Cited in: Foundations: polynomials, fields, and Galois groups · Field extensions and minimal polynomials · The Galois correspondence and intermediate fields · Fekete polynomials

342
NotesUndatedConradGaloisComposita

The Galois correspondence at work

Conrad, Keith. Author-hosted expository notes.

Explains composita, intersections, and changes of coefficient field. Theorem 2.1 describes compatible pairs of automorphisms and the direct-product criterion for two Galois extensions; Theorem 2.6 gives the restriction isomorphism after base extension.

Status and links

Status: Expository notes; unpublished · checked 2026-11-12

Undated author notes. The author states that revised files may replace previous versions without a version history; locators were checked on 12 November 2026.

Cited in: Field extensions and minimal polynomials · The Galois correspondence and intermediate fields

343
NotesUndatedConradGaloisPermutation

Galois groups as permutation groups

Conrad, Keith. Author-hosted expository notes.

Develops the faithful action of a splitting-field Galois group on polynomial roots, the relation between factors and orbits, and examples showing why the permutation action carries information beyond the abstract group.

Status and links

Status: Expository notes; unpublished · checked 2026-11-12

Undated author notes. The author states that revised files may replace previous versions without a version history; locators were checked on 12 November 2026.

Cited in: Foundations: polynomials, fields, and Galois groups · Reduction modulo primes · Frobenius and factorization modulo primes

344
Preprint2026CaoGaoHuangNie2026SparseIrreducibility

Irreducibility Testing of Sparse Polynomials over Integers is NP-hard and Probabilistic Polynomial Time

Cao, Yichuan and Gao, Xiao-Shan and Huang, Qiao-Long and Nie, Jiawei. arXiv:2610.37179v1 [cs.CC], 2026.

Claims coNP-hardness of integer univariate sparse irreducibility under deterministic polynomial-time many-one reductions, already for monic outputs; irreducibility is called NP-hard under one-query Turing reductions. Also claims PP membership using recent preprint inputs on Dedekind zeta functions and effective prime-ideal counts. PP is not a bounded-error randomized algorithm. Theorem 4, Theorem 10, Remark 3, §3.1, and Appendix A.4–A.5 give the reduction types and analytic dependencies.

Status and links

Status: Preprint; version 1, 27 October 2026; claims not independently verified · checked 2026-11-12

Primary version-1 full text inspected on 12 November 2026. The PP upper bound invokes Cureton–Thorner, Hexagon 2610.00200v2, and Frei–Sofos–Widmer, arXiv:2610.18491v2; these analytic claims and the accompanying Lean development were not independently verified. Appendix A.4–A.5 keeps analytic inputs as explicit hypotheses. The title must not be paraphrased as BPP or as many-one NP-hardness of irreducibility.

Cited in: Factoring sparse polynomials

345
Notes2026StacksGeometricIntegrality

Geometrically integral algebras and schemes

The Stacks Project Authors. The Stacks Project, 2026.

Definitions and equivalent tests for geometric integrality. Distinguishes geometric irreducibility from geometric reducedness; this distinction is necessary over imperfect fields.

Status and links

Status: Maintained reference · checked 2026-11-12

Tags 05DW and 038K. Cite the tags because section numbers may change.

Cited in: Polynomials in several variables

347
Book2008Fulton2008Curves

Algebraic Curves: An Introduction to Algebraic Geometry

Fulton, William. Author’s electronic edition, 2008.

A free author-hosted edition developing affine and projective curves, singularities, intersection multiplicities, and Bézout’s theorem. Useful background for geometric proofs of absolute irreducibility.

Status and links

Status: Published book; author-hosted electronic edition · checked 2026-11-12

Electronic edition dated 28 January 2008; original book published in 1969. Chapters 3–5, especially §5.3, are used here.

Cited in: Polynomials in several variables

348
Paper1990PanaitopolStefanescu1990

On the generalized difference polynomials

Panaitopol, Laurenţiu and Ştefănescu, Doru. Pacific Journal of Mathematics, 143(2), 341–348, 1990.

Uses a degree index and a Newton polygon at infinity to prove bivariate irreducibility criteria in arbitrary characteristic. Corollary 3 includes the coprime-degree criterion for f(x)−g(y).

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomials with separated variables

349
Paper1961DavenportLewisSchinzel1961

Equations of the form f(x)=g(y)

Davenport, Harold and Lewis, Donald J. and Schinzel, Andrzej. The Quarterly Journal of Mathematics, 12(1), 304–312, 1961.

A foundational study of separated-variable curves, relating critical values, irreducibility, genus, and Diophantine equations. The critical-value criterion is also explicitly stated in Brindza–Pintér (1997), Theorem A.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomials in several variables · Polynomials with separated variables

350
Paper1997BrindzaPinter1997

On the irreducibility of some polynomials in two variables

Brindza, Béla and Pintér, Ákos. Acta Arithmetica, 82(3), 303–307, 1997.

Applies a Davenport–Lewis–Schinzel critical-value criterion to polynomials made from consecutive linear factors. Theorem A on page 303 states the criterion; the later arguments concern specific families.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomials with separated variables

351
Paper1966Tverberg1966

On the irreducibility of polynomials f(x)+g(y)+h(z)

Tverberg, Helge. The Quarterly Journal of Mathematics, 17(1), 364–366, 1966.

Studies sums in three independent variables, including positive-characteristic obstructions. Read with Schinzel, §1.7, and Singh–Khanduja (2004) for the characteristic-zero theorem and its extensions.

Status and links

Status: Published article · checked 2026-11-12

Publisher metadata verified. The full 1966 paper was not retrieved; the general theorem and historical attribution are checked in Singh–Khanduja’s published account.

Cited in: Polynomials with separated variables

352
Paper2004SinghKhanduja2004

An Extension of the Irreducibility Criteria of Ehrenfeucht and Tverberg

Singh, Amrit Pal and Khanduja, Sudesh K. Communications in Algebra, 32(2), 579–588, 2004.

Extends positive-characteristic results on sums of polynomials in independent variables from three variables to any number at least three. Its introduction records the characteristic-zero theorem and the role of additive-polynomial exceptions.

Status and links

Status: Published article · checked 2026-11-12

Journal issue year 2004; publisher online-posting date is 1 February 2007.

Cited in: Polynomials with separated variables

353
Paper1999CassouNoguesCouveignes1999

Factorisations explicites de g(y)−h(z)

Cassou-Noguès, Pierrette and Couveignes, Jean-Marc. Acta Arithmetica, 87(4), 291–317, 1999.

Gives explicit exceptional pairs of separated-variable polynomials, with families in degrees 7, 11, 13, 15, 21 and 31. Section 5 supplies the pairs used in the later DLS classification.

Status and links

Status: Published article · checked 2026-11-12

Use the article year 1999 shown by the publisher’s item; its volume-page header also contains a conflicting 1998 label.

Cited in: Polynomials with separated variables

354
Preprint2026BehajainaKonigNeftin2026DLS

The Davenport–Lewis–Schinzel problem on the reducibility of f(X)−g(Y)

Behajaina, Angelot and König, Joachim and Neftin, Danny. arXiv, 2026.

Claims a full classification of reducible separated-variable pairs over the complex numbers, with applications to reducible arithmetic fibers and iterates.

Status and links

Status: Preprint; claim not recorded as a published theorem · checked 2026-11-12

Version 1, 29 March 2026. Theorem 1.1 is the complex classification; Theorem 1.2 and Corollary 1.3 have additional hypotheses. The earlier 2025 author manuscript had a more restricted scope.

Cited in: Polynomial decomposition · Irreducibility of iterates · Polynomials with separated variables

355
Paper1989Stein1989

The total reducibility order of a polynomial in two variables

Stein, Yosef. Israel Journal of Mathematics, 68, 109–122, 1989.

For a non-composite bivariate polynomial over an algebraically closed field of characteristic zero, bounds the sum of the numbers of distinct fiber components minus one by total degree minus one.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial fibers and Bertini’s theorem

356
Paper1993Lorenzini1993

Reducibility of polynomials in two variables

Lorenzini, Dino. Journal of Algebra, 156(1), 65–75, 1993.

Extends and refines bounds on reducible polynomial fibers, including the two-variable Stein inequality in arbitrary characteristic. The hypotheses concern non-composite polynomials over an algebraically closed field.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial fibers and Bertini’s theorem

357
Paper2009BodinDebesNajib2009Spectrum

Indecomposable polynomials and their spectrum

Bodin, Arnaud and Dèbes, Pierre and Najib, Salah. Acta Arithmetica, 139(1), 79–100, 2009.

Studies exceptional reducible fibers and their behavior under ring morphisms, specialization, and reduction. The introduction separates ordinary irreducibility of F−t from geometric generic-fiber irreducibility; Theorem 2.1 controls the spectral divisor outside an exceptional locus.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial fibers and Bertini’s theorem

358
Paper2023BenelmekkiNajib2023

A note on the spectrum of a rational function

Benelmekki, Mohamed and Najib, Salah. Annales mathématiques Blaise Pascal, 30(2), 107–114, 2023.

Revisits a bound for the total reducibility order of a non-composite rational function using a form of Lüroth’s theorem. A useful continuation from polynomial fibers to pencils P−λQ.

Status and links

Status: Published article · checked 2026-11-12

Journal volume year 2023; published online 30 April 2024.

Cited in: Polynomial fibers and Bertini’s theorem

359
Paper2016CharlesPoonen2016

Bertini irreducibility theorems over finite fields

Charles, François and Poonen, Bjorn. Journal of the American Mathematical Society, 29(1), 81–94, 2016.

For a geometrically irreducible subscheme of projective space over a finite field with dimension at least two, proves that the density of geometrically irreducible hypersurface sections tends to one as their degree grows. Read with the 2019 erratum.

Status and links

Status: Published article · checked 2026-11-12

The corrected author version is dated 3 May 2017. The older Paris-Saclay manuscript was used to check Theorem 1.1; the published erratum leaves the main results unchanged.

Cited in: Polynomial fibers and Bertini’s theorem

360
Paper2019CharlesPoonen2019Erratum

Erratum to “Bertini irreducibility theorems over finite fields”

Charles, François and Poonen, Bjorn. Journal of the American Mathematical Society, 32(2), 605–607, 2019.

Corrects the proof of Lemma 5.1 in the 2016 paper. The main results are unchanged.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial fibers and Bertini’s theorem

361
Paper2022PoonenSlavov2022

The Exceptional Locus in the Bertini Irreducibility Theorem for a Morphism

Poonen, Bjorn and Slavov, Kaloyan. International Mathematics Research Notices, 2022(6), 4503–4513, 2022.

Bounds the dimension of hyperplanes with geometrically reducible inverse image for a morphism whose nonempty fibers have constant dimension. Uses random hyperplane slicing over finite fields and gives an application to monodromy.

Status and links

Status: Published article · checked 2026-11-12

Published online 4 August 2020; journal issue year 2022.

Cited in: Polynomial fibers and Bertini’s theorem

362
Paper2022KmenttShute2022

The Bertini irreducibility theorem for higher codimensional slices

Kmentt, Philip and Shute, Alec. Finite Fields and Their Applications, 83, 102085, 2022.

Extends dimension bounds for exceptional hyperplane sections to linear subspaces of higher codimension. Theorem 1.2 is the main bound, over an arbitrary field.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Polynomial fibers and Bertini’s theorem

363
Paper2025Weimann2025ConvexDense

Improvements of convex-dense factorization of bivariate polynomials

Weimann, Martin. Polynesian Journal of Mathematics, 2(4), 1–34, 2025.

A bivariate factorization algorithm using Newton-polygon area and lattice lengths. Nondegeneracy and characteristic assumptions are explicit; its arithmetic-operation bounds include separate univariate factorizations.

Status and links

Status: Published article · checked 2026-11-12

Published 24 July 2025. The author’s publications page still labels the work as a preprint; the publisher’s final PDF establishes publication.

Cited in: Newton polytopes and irreducibility · Factorization in several variables

364
Paper2025DeminHoeven2025Sparse

Factoring sparse polynomials fast

Demin, Alexander and van der Hoeven, Joris. Journal of Complexity, 88, 101934, 2025.

Develops probabilistic sparse multivariate factorization, gcd, squarefree factorization, and related methods through sparse interpolation and reductions in the number of variables. Bounds account for sparse evaluation and interpolation costs.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Factorization in several variables

365
Paper2011HoppenRodriguesTrevisan2011

A note on Gao’s algorithm for polynomial factorization

Hoppen, Carlos and Rodrigues, Virgínia M. and Trevisan, Vilmar. Theoretical Computer Science, 412(16), 1508–1522, 2011.

Studies Gao’s differential method in arbitrary characteristic. Identifies subspaces associated with absolute and rational factors; also explains when the unmodified solution-space dimension is only an upper bound.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Factorization in several variables

366
Preprint2026Weinbaum2026ShiftedExponential

Galois Groups of Shifted Exponential Polynomials

Weinbaum, Shachar. arXiv:2610.26873v2, 2026.

Claims density-one symmetric Galois group for every fixed positive shift of the exponential Taylor coefficients. The shift is fixed while the degree grows; exceptional degrees are allowed. See Theorem 1.1 and §§2–4.

Status and links

Status: Preprint; version 2, 21 October 2026; full proof not independently verified · checked 2026-11-12

Cited in: Taylor polynomials

367
Paper2021DebesKonigLegrandNeftin2021Generic

On parametric and generic polynomials with one parameter

Dèbes, Pierre and König, Joachim and Legrand, François and Neftin, Danny. Journal of Pure and Applied Algebra, 225(10), Article 106717, 2021.

Distinguishes parametric from generic polynomial families. Theorem 1.2 detects non-genericity after specified field extensions; Corollary 1.3 classifies one-parameter generic polynomials over Q, with nontrivial groups C₂, C₃, and S₃. Corollary 3.6 treats characteristic-zero base fields.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Generic polynomials and invariant fields · Inverse Galois theory and generic polynomials

368
Paper2025CluckersDebesHendelNguyenVermeulen2025

Improvements on dimension growth results and effective Hilbert’s irreducibility theorem

Cluckers, Raf and Dèbes, Pierre and Hendel, Yotam I. and Nguyen, Kien Huu and Vermeulen, Floris. Forum of Mathematics, Sigma, 13, Article e153, 1–30, 2025.

Theorem 1.10 gives a higher-dimensional effective Hilbert irreducibility bound with explicit degree and coefficient-height dependence, allowing several variables to remain after specialization. The paper also proves dimension-growth estimates and a related effective Bertini statement.

Status and links

Status: Published article; online 19 September 2025 · checked 2026-11-12

Cited in: Exceptional specializations

369
Preprint2026KadetsNeftin2026Algebraic

Hilbert irreducibility for algebraic points

Kadets, Borys and Neftin, Danny. arXiv preprint, 2026.

Studies finiteness of reducible fibers above algebraic parameters of bounded degree, with the unavoidable images of low-degree points treated separately. Corollary 3.14 gives an explicit branch-count bound for indecomposable polynomial maps. Claims are recorded as preprint results, not as published theorems.

Status and links

Status: Preprint; version 1, 9 June 2026 · checked 2026-11-12

Cited in: Exceptional specializations

370
Paper1969Swan1969Invariants

Invariant rational functions and a problem of Steenrod

Swan, Richard G. Inventiones Mathematicae, 7, 148–158, 1969.

Gives a classical negative answer to Noether’s rationality problem, including the cyclic group C₄₇ over Q. The obstruction concerns the rationality of an invariant field; it does not prevent C₄₇ from being a Galois group over Q.

Status and links

Status: Published article · checked 2026-11-12

Cited in: Generic polynomials and invariant fields

371
Paper2026TaNgo2026MultipleEulerian

Multiple Eulerian polynomials

Ta, Thi Hoai An and Ngo, Quoc Hoan. The Journal of Analysis, 34, 21–34, 2026.

Develops recurrences and real-rootedness for multiple Eulerian polynomials. The introduction also attributes the large irreducible-factor bound for ordinary Eulerian polynomials to Heidrich; it is used here as a secondary attribution source.

Status and links

Status: Published article; attribution checked in institutional manuscript · checked 2026-11-12

Published online 22 December 2025; assigned to volume 34 (2026), pp. 21–34. Heidrich attribution checked in the institutional manuscript, introduction p. 2. The corresponding final-journal page was not checked. The original Heidrich paper remains unread in this audit.

Cited in: Eulerian polynomials

372
Paper1986BlessenohlJohnsen1986

Eine Verschärfung des Satzes von der Normalbasis

Blessenohl, D. and Johnsen, K. Journal of Algebra, 103(1), 141–159, 1986.

The completely normal basis theorem: a finite Galois extension has an element normal over every intermediate field. In particular, every finite-field extension has a completely normal element; simultaneous primitivity is the additional Morgan–Mullen requirement.

Status and links

Status: Published article · checked 2026-11-12

The finite-field statement and original attribution were checked in Garefalakis–Kapetanakis (2026), Theorem 1.3 and reference [6]. The original 1986 proof was not retrieved.

Cited in: Primitive and normal elements

373
Resource2026Hellwig2026Formalization

Resolvent Components of Completely Normal Elements and the Morgan–Mullen Conjecture: Lean 4 Formalisation and Python Programs

Hellwig, Florian. Author repository; release v1.0, 2026.

Version 1.0 pins the Lean formalization and finite computations accompanying arXiv:2610.36534. The axiom audit records the Garefalakis–Kapetanakis and Rosser–Schoenfeld inputs, as well as Lean.ofReduceBool and Lean.trustCompiler. Build instructions and the dependency manifest identify the reproducibility requirements.

Status and links

Status: Author-reported formalization; not independently audited · checked 2026-11-12

Tag v1.0 resolves to commit 09291f9dbd175ffdd8c22cddcbaff7152c516272. README, declared axioms, and dependency manifest inspected through GitHub; the Zenodo archive was linked by the author but not independently downloaded. No Lean build or full dependency audit performed.

Cited in: Primitive and normal elements

374
Preprint2026KadetsMangoubi2026Legendre

Root sharing and 2-adic interpolation for Legendre polynomials

Kadets, Borys and Mangoubi, Dan. arXiv preprint, 2026.

Studies common nonzero roots of distinct Legendre polynomials. Theorem 1.2 bounds the number of indices sharing a fixed nonzero root of P_l by 2l, using 2-adic interpolation. Conjecture 1.1 predicts pairwise disjointness of the nonzero root sets; §1.5 separately records the stronger recent irreducibility claim.

Status and links

Status: Preprint; version 1, 6 November 2026 · checked 2026-11-12

Conjecture 1.1, Theorem 1.2, and §1.5 remark checked in version 1. The full proof was not independently audited.

Cited in: Hermite, Bessel, and Legendre polynomials

375
Paper2017Schleicher2017Galois

Internal Addresses of the Mandelbrot Set and Galois Groups of Polynomials

Schleicher, Dierk. Arnold Mathematical Journal, 3, 1–35, 2017.

Uses internal addresses and analytic continuation to study quadratic dynamics. Theorem 7.1 gives the full centralizer Galois group for the quadratic dynatomic polynomial. Conjecture 7.2 is interpreted for the reduced Gleason polynomial: the displayed definition immediately preceding it instead uses fc∘n(c)−c=(fc∘n(0))2f_c^{\circ n}(c)-c=(f_c^{\circ n}(0))^2 and hence gives squared factors.

Status and links

Status: Published article · checked 2026-11-12

Final journal PDF checked, especially Theorem 7.1 and Conjecture 7.2, pp. 27–28. Published online in 2016; volume year 2017. The reduced-polynomial formulation is an explicit interpretation of the conjecture, not a literal transcription of the displayed squared normalization.

Cited in: Specialization and Hilbert irreducibility · Gleason and Misiurewicz polynomials

376
Thesis1992Bousch1992Thesis

Sur quelques problèmes de dynamique holomorphe

Bousch, Thierry. Université de Paris-Sud, Orsay, 1992.

Original thesis source for irreducibility and the full centralizer Galois group of quadratic dynatomic polynomials. Krumm cites Chapter 3, Theorem 3; Buff–Tan credits Bousch and, independently, Lau–Schleicher for irreducibility.

Status and links

Status: Doctoral thesis · checked 2026-11-12

Author page confirms the title and defense in April 1992 at Orsay. The thesis itself was not retrieved; theorem attribution and locator were checked in Krumm, Proposition 2.2, and in Buff–Tan.

Cited in: Specialization and Hilbert irreducibility · Gleason and Misiurewicz polynomials

377
Preprint1994LauSchleicher1994

Internal addresses in the Mandelbrot set and irreducibility of polynomials

Lau, Eike and Schleicher, Dierk. Stony Brook Institute for Mathematical Sciences, Preprint 1994/19, 1994.

Studies internal addresses and proves irreducibility results for quadratic dynatomic polynomials. Buff–Tan identifies this as an independent original irreducibility proof alongside Bousch; Schleicher’s 2017 article develops the internal-address approach further.

Status and links

Status: Preprint; Stony Brook IMS 1994/19 · checked 2026-11-12

Title, authors, year, and preprint number checked in the original scan and corroborating primary papers. This 1994 joint preprint is a different work from Schleicher’s 2017 published article.

Cited in: Gleason and Misiurewicz polynomials

378
Paper2022BuffFloydKochParry2022

Factoring Gleason polynomials modulo 2

Buff, Xavier and Floyd, William and Koch, Sarah and Parry, Walter. Journal de théorie des nombres de Bordeaux, 34(3), 787–812, 2022.

Describes the factorization of quadratic Gleason polynomials modulo 2. Theorems 1.5–1.6 give the same explicit count for real roots and irreducible factors over F₂; the real-root formula is credited there to Lutzky. The paper states the characteristic-zero irreducibility conjecture and supplies the earlier counting result behind the later Baker–Chen–Li–Qian bijection.

Status and links

Status: Published article · checked 2026-11-12

Journal metadata and Theorems 1.4–1.6 checked in the published text, especially p. 789. Volume year 2022; published online on 27 January 2023.

Cited in: Gleason and Misiurewicz polynomials

379
Book1984DouadyHubbard1984

Étude dynamique des polynômes complexes. Première partie

Douady, Adrien and Hubbard, John H. Publications mathématiques d’Orsay 84-02, Université de Paris-Sud, Orsay, Report 84-02, 1984.

First part of the foundational monograph on polynomial dynamics, including the Mandelbrot set and the analytic and combinatorial background for periodic-point curves. The original smoothness result for quadratic dynatomic curves is attributed to Douady–Hubbard in Buff–Tan, whose bibliography points specifically to the second part.

Status and links

Status: Published monograph · checked 2026-11-12

Title page and report number checked. Included with the second part as background; the original smoothness proof has not been independently audited here.

Cited in: Gleason and Misiurewicz polynomials

380
Book1985DouadyHubbard1985

Étude dynamique des polynômes complexes. Deuxième partie

Douady, Adrien and Hubbard, John H. Publications mathématiques d’Orsay 85-04, Université de Paris-Sud, Orsay, Report 85-04, 1985.

Second part of the foundational monograph on polynomial dynamics, with contributions by Pierre Lavaurs, Tan Lei, and Pierrette Sentenac. Buff–Tan cites this source for the original smoothness theorem for quadratic dynatomic curves and supplies a later proof using quadratic differentials.

Status and links

Status: Published monograph · checked 2026-11-12

Title page and report number checked. The attribution is verified through Buff–Tan, Theorem 1.1; the original proof has not been independently audited here.

Cited in: Gleason and Misiurewicz polynomials

381
Paper1998KanekoZagier1998Supersingular

Supersingular j-invariants, hypergeometric series, and Atkin’s orthogonal polynomials

Kaneko, Masanobu and Zagier, Don. AMS/IP Studies in Advanced Mathematics, 7, 97–126, 1998.

Theorem 1 identifies prime-index reductions of modular polynomial factors, with their prescribed elliptic factors, with the supersingular j-polynomial. Theorem 5 gives hypergeometric descriptions underlying the four Kaneko–Zagier Jacobi families.

Status and links

Status: Published chapter · checked 2026-11-15

Full primary author text inspected for Theorem 1 and the modular normalization; volume and page range verified against Kaneko’s publication list.

Cited in: Kaneko–Zagier polynomials

382
Paper2026AlekseyevAmdeberhanShallitVukusic2026

On the p-adic valuations of values of Legendre polynomials

Alekseyev, Max A. and Amdeberhan, Tewodros and Shallit, Jeffrey and Vukusic, Ingrid. Research in Number Theory, 12, Article 52, 2026.

Gives exact valuations of Legendre polynomials at rational arguments divisible by the valuation prime. For evaluation at an odd prime, Theorems 4 and 6 give formulas in binomial valuations and digit sums and an all-degree base-p recurrence; Theorem 5 treats p=2 separately.

Status and links

Status: Published article; 11 May 2026 · checked 2026-11-15

The publisher confirms Research in Number Theory 12, article 52 (2026), published 11 May 2026. Theorem locators refer to the open author manuscript dated 4 July 2025, whose full relevant statements and proofs were inspected.

Cited in: Hermite, Bessel, and Legendre polynomials

383
Paper1987Osada1987II

The Galois groups of the polynomials x^n+ax^s+b, II

Osada, Hiroyuki. Tohoku Mathematical Journal, 39(3), 437–445, 1987.

Ramification criteria for symmetric trinomial Galois groups. Lemmas 6 and 10 record the primitive-group transposition criterion and prime-degree primitivity used in modular Galois certificates.

Status and links

Status: Published · checked 2026-11-15

Cited in: Frobenius and factorization modulo primes

384
Paper2024Emmrich2024Minors

Nonvanishing minors of eigenvector matrices and consequences

Emmrich, Tarek. Special Matrices, 12(1), Article 20240020, 2024.

Alternating-group containment for the characteristic polynomial forces nonvanishing of every eigenvector minor. Theorem 10 identifies nonvanishing of all minors with a support uncertainty inequality. Applied with a probabilistic Galois theorem, the arithmetic hypotheses and probability estimate remain in force.

Status and links

Status: Published article · checked 2026-11-15

Published 16 August 2024. Theorem 2 supplies the eigenvector-minor criterion; Theorem 10 supplies the support uncertainty equivalence. The open manuscript arXiv:2304.12075v3 has the earlier title “Chebotarëv’s nonvanishing minors for eigenvectors of random matrices and graphs”; its uncertainty equivalence is Theorem 9, corresponding to published Theorem 10.

Cited in: Characteristic polynomials of random matrices

385
Preprint2026DasDuttaLaishramNair2026Laguerre

Irreducibility of Generalised Laguerre Polynomials for Large Integer Parameters

Das, Drishya T. and Dutta, Saheli and Laishram, Shanta and Nair, Saranya G. arXiv preprint, 2026.

Claims the complete irreducibility classification for integer 0≤a≤1000 in every degree, with explicit quadratic and quartic exceptions. The atlas verifies those exceptions but records a statement/proof mismatch in v1 Lemma 6.1(iii); exhaustiveness of the later finite pruning under weaker restrictions remains unchecked.

Status and links

Status: Preprint; version 1, 7 October 2026; no peer-reviewed publication verified · checked 2026-11-15

The full primary PDF was downloaded and read. The abstract’s abbreviated irreducibility statement omits the explicit exceptions; Theorem 1.1, p. 2, is the authoritative scope. Proof audit, 15 November 2026: pp. 13–14 give different logical conditions in Lemma 6.1(iii) and its proof; Lemmas 6.5–6.6 use that lemma. The classification remains a preprint claim.

Cited in: Generalized Laguerre polynomials

386
Paper2018KresoTichy2018Separated

Diophantine equations in separated variables

Kreso, Dijana and Tichy, Robert F. Periodica Mathematica Hungarica, 76, 47–67, 2018.

Published Lemmas 3.2 and 3.3 connect functional indecomposability with primitive monodromy and off-diagonal irreducibility with double transitivity. Proposition 3.8 treats polynomials with at least two distinct critical points and pairwise distinct critical values, allowing nonsimple critical points.

Status and links

Status: Published article · checked 2026-11-15

Online publication 1 August 2017; journal volume year 2018. The earlier arXiv:1601.07316v1 has a different title and different lemma/proposition numbering.

Cited in: Polynomial decomposition

387
Report1979Rabin1979Report

Probabilistic Algorithm in Finite Fields

Rabin, Michael O. MIT Laboratory for Computer Science, MIT-LCS-TR-213, 1979.

Original author report. Section 1, Lemma 1, printed pages 7–8, gives the necessary and sufficient irreducibility criterion using one Frobenius divisibility condition and gcd tests indexed by prime divisors of the polynomial degree. The statement is over a prime field; its proof extends to any finite field.

Status and links

Status: Technical report; later journal article published in 1980 · checked 2026-11-15

January 1979 report, distinct from the 1980 SIAM Journal on Computing article Probabilistic algorithms in finite fields (DOI 10.1137/0209024). Lemma and page locators here refer to this report.

Cited in: Irreducibility over finite fields

388
Preprint2026Palfy2026Galois

Galois’s lost proof on PSL(2,p)

Pálfy, Péter P. arXiv:2611.06054v1, 2026.

A possible reconstruction of Galois’s argument for the classical index-p subgroup theorem for PSL(2,p). Theorems 1–2 and §4 give simplicity and the exceptional primes 5, 7, 11. The atlas derives a minimum-degree consequence for an already-given Galois extension.

Status and links

Status: Preprint; classical theorem and historical reconstruction · checked 2026-11-15

Version 1, submitted 4 November 2026. The historical reconstruction is not a recovered proof manuscript. The geometric verification in §4 is explicitly described as anachronistic by the author.

Cited in: Foundations: polynomials, fields, and Galois groups

389
Preprint2026Garmi2026Trinomials

Galois Groups of Trinomials with Small Coefficients

Garmi, Hilel. arXiv:2610.22764v3, 2026.

Version 3, Corollary 1.3, states that the degree-(n−1) signed coefficient polynomial associated with x^n−2x^k+1 has group S_(n−1) over Q for coprime n>k>0 and n>8. The statement and nearby definitions were inspected; the full proof was not independently verified.

Status and links

Status: Preprint · checked 2026-11-16

Version 3 dated 23 October 2026. No journal publication asserted.

Cited in: Trinomials

Comments

Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.