Follow the arguments in linked diagrams →
| Given | Method | Conclusion | Limitations |
|---|---|---|---|
| A primitive and primes not dividing its leading coefficient | Reduction and factor-degree intersections | Irreducibility if no proper degree survives all reductions | Reducible reduction at one prime does not prove rational reducibility. |
| Coefficient valuations at a prime | Eisenstein or a primitive single Newton edge | Irreducibility over the local field and over the ground field | Check all coefficient inequalities and the coprimality of the edge lengths. |
| Newton polygons at one or more primes | Slope denominators and possible factor degrees | Irreducibility if the sets of possible proper degrees have empty intersection | A 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 argument | Perron's criterion and archimedean factor bounds | Irreducibility from root location and integral constant terms or factor evaluations | Perron's test needs monicity and a nonzero constant term; the displayed bounds are strict. |
| Distinct integer arguments with small nonzero values, or at least unit or prime values for a primitive degree- polynomial | Schur, Pólya, and prime-value criteria | Irreducibility from restrictions on integral factor values | The number of arguments and the value bound depend on the degree. |
| An irreducible and a nonconstant | Capelli’s theorem | Irreducibility of is equivalent to that of over , where | For the binomial criterion, include its characteristic and exceptional fourth-power conditions. |
| Fixed in a family | Large-gap theorems | Irreducibility of the nonreciprocal part for sufficiently large exponent | The coprimality and power hypotheses are essential. |
| A degree-preserving squarefree reduction modulo a prime | Frobenius factorization theorem | A Galois element with the observed factor degrees as cycle lengths | A finite search that misses a cycle type does not exclude it. |
| Transitivity or primitivity, with specified cycles | Permutation-group criteria | Containment of or equality with | A transitive group containing a transposition need not be symmetric. |
| A separable polynomial in characteristic different from two, with | Discriminant square class | for a square discriminant and otherwise | Without -containment, a nonsquare discriminant gives only an odd permutation. |
| Reciprocal symmetry, parity, or polynomial composition | Root pairs and blocks | A structural upper bound on the group | The group on blocks does not determine the kernel. |
| Several subgroups compatible with the known root action | Resolvents and relative invariants | Further subgroup restrictions or a group determination | A simple resolvent root is needed in the standard subgroup test. |
| A separable irreducible family over , with Hilbertian | Hilbert irreducibility | Infinitely many specializations preserving irreducibility; a Galois form preserves the group | Finiteness of the exceptional set requires stronger hypotheses. |
| A polynomial and its iterates | Capelli’s theorem and critical orbits | Irreducibility at each level under the stated orbit conditions | A separate specialization at each level does not give one parameter valid at every level. |
| A monic polynomial over | Frobenius congruences and gcd tests | An exact irreducibility test | Primitivity is a further condition on the order of a root. |
| A polynomial in several variables, with a specified ground field | Newton polytopes, specialization, and effective criteria | Irreducibility or absolute irreducibility under the chosen criterion | Remove monomial factors; keep degree-preservation and characteristic hypotheses. |
| A coefficient distribution and a limiting parameter | Factor exclusion, local distributions, and sieve methods | A probability estimate for that model | Check conditioning, the exact group conclusion, and any analytic hypothesis. |
| Characteristic zero; degree n≥2; simple critical points with distinct critical values | Morse polynomial criterion | Geometric and arithmetic group | The group can decrease in a special fiber. |
| A number-field polynomial given by sparse coefficients and binary exponents | Gap methods and bounded-degree factorization | All factors up to a specified degree, with multiplicities | A bound polynomial in the degree cutoff need not be polynomial in its binary length. |
Methods
No matches. Try fewer words or reset the filters.
Reduction modulo primes
Factoring modulo primes gives restrictions on the degrees of rational factors. Incompatible restrictions prove irreducibility.
ArticleSchönemann–Eisenstein and Dumas criteria
Divisibility and coefficient valuations prove irreducibility by the Schönemann–Eisenstein and Dumas criteria. Translation provides further applications.
ArticleNewton polygons and Galois groups
Coefficient valuations determine root valuations and restrict factor degrees. Suitable Newton slopes also imply containment of the alternating group.
ArticleRoot bounds and prime-value criteria
Perron’s criterion uses the size of coefficients to locate roots. Prime-value criteria combine integer evaluations with root bounds or digit conditions.
ArticleIrreducibility from integer values
Schur’s theorem and Pólya’s criterion prove irreducibility from small integer values. A separate criterion uses prime and unit values.
ArticleSparse polynomials and factor reversal
For polynomials with two widely separated blocks of coefficients, large-gap theorems prove irreducibility of the nonreciprocal part under explicit hypotheses.
ArticleCapelli’s theorem and polynomial composition
Capelli’s theorem tests a composition over the field generated by a root. Binomial criteria and norms give applications to powers and iterates.
ArticleFrobenius and factorization modulo primes
Factor degrees modulo a good prime give cycle lengths in the Galois group. Combining these cycles can determine the group.
ArticleDiscriminants, 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.
ArticleRamification 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.
ArticleTransitivity, primitivity, and cycle criteria
Primitivity and cycle structure give criteria for G ⊇ Aₙ and G = Sₙ.
ArticleResolvents and subgroup tests
Resolvents convert the Galois action on expressions in the roots into factorization tests for subgroups.
ArticleReciprocal polynomials
A reciprocal polynomial of degree reduces to a polynomial of degree in . Its roots then require quadratic extensions.
ArticleSpecialization and Hilbert irreducibility
Hilbert irreducibility preserves the Galois group for many parameter values. Exceptional values are studied through resolvents, rational points, and local conditions.
ArticleCritical points and polynomial monodromy
In characteristic zero, simple critical points with distinct critical values force the generic Galois group to be symmetric.
ArticleComposition and iteration
Composition gives towers of field extensions. Iteration leads to irreducibility questions at every depth and Galois actions on trees of preimages.
ArticlePolynomial decomposition
Ritt’s theorems describe factorizations under composition. Intermediate fields and blocks connect these decompositions with monodromy.
ArticleIrreducibility of iterates
Capelli’s lemma, norms, and valuations prove irreducibility at successive depths. Eventual stability asks for a bounded number of factors.
ArticleArboreal Galois groups
The Galois groups of iterated preimage equations act on rooted trees. Critical values can detect maximal groups and explain smaller ones.
ArticleFinite fields and Frobenius
Every finite field has a unique extension of each degree, up to isomorphism. Frobenius determines conjugates, subfields, and factor degrees.
ArticleIrreducibility over finite fields
Frobenius gives an exact irreducibility test, a counting formula, and a method for constructing irreducible polynomials.
ArticleIrreducible 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.
ArticlePrimitive 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.
ArticleFactorization 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.
ArticlePolynomials in several variables
Irreducibility over a field, absolute irreducibility, and the geometry of polynomial equations.
ArticleNewton 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.
ArticlePolynomials with separated variables
Criteria for f(x)−g(y), sums in independent variables, and the Davenport–Lewis–Schinzel problem.
ArticlePolynomial fibers and Bertini’s theorem
Composition, exceptional reducible fibers, and the irreducibility of general sections.
ArticleFactorization in several variables
Coefficient equations, local factorization, differential methods, and algorithms that use sparse support.
ArticlePolynomial factorization algorithms
Algorithms over finite fields use Frobenius and linear algebra. Over the rationals, modular factorization, Hensel lifting and lattice reduction recover exact factors.
ArticleFactoring sparse polynomials
Sparse polynomials are encoded by their nonzero terms. Large exponents and dense factors make this a different algorithmic problem from dense factorization.
ArticleAlgorithms 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.