Method

GivenMethodConclusionLimitations
A primitive f∈Z[x]f\in\mathbb Z[x] and primes not dividing its leading coefficientReduction and factor-degree intersectionsIrreducibility if no proper degree survives all reductionsReducible reduction at one prime does not prove rational reducibility.
Coefficient valuations at a primeEisenstein or a primitive single Newton edgeIrreducibility over the local field and over the ground fieldCheck all coefficient inequalities and the coprimality of the edge lengths.
Newton polygons at one or more primesSlope denominators and possible factor degreesIrreducibility if the sets of possible proper degrees have empty intersectionA slope denominator alone need not give one cycle of that length.
A monic integer polynomial satisfying Perron's coefficient inequality, or a root bound at a prime-valued argumentPerron's criterion and archimedean factor boundsIrreducibility from root location and integral constant terms or factor evaluationsPerron's test needs monicity and a nonzero constant term; the displayed bounds are strict.
Distinct integer arguments with small nonzero values, or at least 2n+12n+1 unit or prime values for a primitive degree-nn polynomialSchur, Pólya, and prime-value criteriaIrreducibility from restrictions on integral factor valuesThe number of arguments and the value bound depend on the degree.
An irreducible F∈K[x]F\in K[x] and a nonconstant g∈K[x]g\in K[x]Capelli’s theoremIrreducibility of F(g)F(g) is equivalent to that of g−αg-\alpha over K(α)K(\alpha), where F(α)=0F(\alpha)=0For the binomial criterion, include its characteristic and exceptional fourth-power conditions.
Fixed c,dc,d in a family xNc(x−1)+d(x)x^N c(x^{-1})+d(x)Large-gap theoremsIrreducibility of the nonreciprocal part for sufficiently large exponentThe coprimality and power hypotheses are essential.
A degree-preserving squarefree reduction modulo a primeFrobenius factorization theoremA Galois element with the observed factor degrees as cycle lengthsA finite search that misses a cycle type does not exclude it.
Transitivity or primitivity, with specified cyclesPermutation-group criteriaContainment of AnA_n or equality with SnS_nA transitive group containing a transposition need not be symmetric.
A separable polynomial in characteristic different from two, with G⊇AnG\supseteq A_nDiscriminant square classG=AnG=A_n for a square discriminant and G=SnG=S_n otherwiseWithout AnA_n-containment, a nonsquare discriminant gives only an odd permutation.
Reciprocal symmetry, parity, or polynomial compositionRoot pairs and blocksA structural upper bound on the groupThe group on blocks does not determine the kernel.
Several subgroups compatible with the known root actionResolvents and relative invariantsFurther subgroup restrictions or a group determinationA simple resolvent root is needed in the standard subgroup test.
A separable irreducible family over K(t)K(t), with KK HilbertianHilbert irreducibilityInfinitely many specializations preserving irreducibility; a Galois form preserves the groupFiniteness of the exceptional set requires stronger hypotheses.
A polynomial and its iteratesCapelli’s theorem and critical orbitsIrreducibility at each level under the stated orbit conditionsA separate specialization at each level does not give one parameter valid at every level.
A monic polynomial over Fq\mathbb F_qFrobenius congruences and gcd testsAn exact irreducibility testPrimitivity is a further condition on the order of a root.
A polynomial in several variables, with a specified ground fieldNewton polytopes, specialization, and effective criteriaIrreducibility or absolute irreducibility under the chosen criterionRemove monomial factors; keep degree-preservation and characteristic hypotheses.
A coefficient distribution and a limiting parameterFactor exclusion, local distributions, and sieve methodsA probability estimate for that modelCheck conditioning, the exact group conclusion, and any analytic hypothesis.
Characteristic zero; degree n≥2; simple critical points with distinct critical valuesMorse polynomial criterionGeometric and arithmetic group SnS_nThe group can decrease in a special fiber.
A number-field polynomial given by sparse coefficients and binary exponentsGap methods and bounded-degree factorizationAll factors up to a specified degree, with multiplicitiesA bound polynomial in the degree cutoff need not be polynomial in its binary length.

Methods

methodStart hereQ

Reduction modulo primes

Factoring modulo primes gives restrictions on the degrees of rational factors. Incompatible restrictions prove irreducibility.

Article
methodIntermediateQ

Newton polygons and Galois groups

Coefficient valuations determine root valuations and restrict factor degrees. Suitable Newton slopes also imply containment of the alternating group.

Article
methodIntermediateFields of characteristic not 2; Q

Discriminants, parity, and ramification

The discriminant detects repeated roots. For a separable polynomial in characteristic different from two, its square class determines whether every Galois permutation is even.

Article
methodIntermediateQ and local fields

Ramification and inertia

Inertia describes the Galois action at ramified primes. An odd prime dividing a monic integer polynomial’s discriminant exactly once gives a transposition.

Article
methodIntermediateQ; fields of characteristic not 2 for quartics

Resolvents and subgroup tests

Resolvents convert the Galois action on expressions in the roots into factorization tests for subgroups.

Article
methodIntermediateCharacteristic different from 2

Reciprocal polynomials

A reciprocal polynomial of degree 2m2m reduces to a polynomial of degree mm in x+x−1x+x^{-1}. Its roots then require quadratic extensions.

Article
methodIntermediatenumber fields

Specialization and Hilbert irreducibility

Hilbert irreducibility preserves the Galois group for many parameter values. Exceptional values are studied through resolvents, rational points, and local conditions.

Article
methodIntermediategeneral fields and number fields

Composition and iteration

Composition gives towers of field extensions. Iteration leads to irreducibility questions at every depth and Galois actions on trees of preimages.

Article
methodIntermediateC; characteristic-zero function fields; tame and wild algorithms

Polynomial decomposition

Ritt’s theorems describe factorizations under composition. Intermediate fields and blocks connect these decompositions with monodromy.

Article
methodIntermediateGeneral fields; quadratic criteria in characteristic ≠2; Q

Irreducibility of iterates

Capelli’s lemma, norms, and valuations prove irreducibility at successive depths. Eventual stability asks for a bounded number of factors.

Article
methodIntermediateGeneral preimage trees; quadratic square-class criterion over Q

Arboreal Galois groups

The Galois groups of iterated preimage equations act on rooted trees. Critical values can detect maximal groups and explain smaller ones.

Article
methodStart hereFinite fields

Finite fields and Frobenius

Every finite field has a unique extension of each degree, up to isomorphism. Frobenius determines conjugates, subfields, and factor degrees.

Article
methodIntermediatefinite fields

Irreducible polynomials with coefficient restrictions

Prescribed coefficients and allowed coefficient sets lead to different existence and counting problems. Trace and norm explain the first and constant coefficients; character sums and sieves treat more general restrictions.

Article
methodIntermediateFinite fields

Primitive and normal elements

A primitive element generates the multiplicative group. The conjugates of a normal element form a basis. Every finite-field extension contains an element with both properties.

Article
methodIntermediateFinite fields

Factorization statistics over finite fields

Factor degrees follow permutation cycle statistics in several large-field limits. Exact counting explains the unrestricted case; monodromy and point counting handle suitable families.

Article
methodIntermediatearbitrary fields

Newton polytopes and irreducibility

Factorization gives a Minkowski decomposition of the exponent polytope. A positive-dimensional, integrally indecomposable polytope proves absolute irreducibility when monomial factors are excluded.

Article
methodIntermediatearbitrary fields for coprime degrees; characteristic zero for the classification

Polynomials with separated variables

Criteria for f(x)−g(y), sums in independent variables, and the Davenport–Lewis–Schinzel problem.

Article
algorithmIntermediateFinite fields, Q, and p-adic fields

Polynomial factorization algorithms

Algorithms over finite fields use Frobenius and linear algebra. Over the rationals, modular factorization, Hensel lifting and lattice reduction recover exact factors.

Article
methodResearchnumber fields and general coefficient fields

Factoring sparse polynomials

Sparse polynomials are encoded by their nonzero terms. Large exponents and dense factors make this a different algorithmic problem from dense factorization.

Article
algorithmIntermediateQ, number fields, and p-adic fields

Algorithms for Galois groups

Galois-group algorithms combine local factorizations, permutation groups and resolvents. Certification proves that the resulting subgroup is the full group.

Article

Comments

Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.