Each diagram sits beside its mathematical explanation. Follow a node to the relevant article, or an arrow label to the exact source and hypotheses.
→ Deduction or flow of information. ↔ Equivalence. AND Joint requirements. OR Alternatives. Dashed arrows depend on a preprint claim; they keep the same logical direction.
Scope and publication status are stated separately. A checked citation records inspection of the stated source; it does not certify the full proof of a recent preprint.
No matches. Try fewer words or reset the filters.
Subgroup index and the smallest defining equation
Subgroups, root fields, and faithful permutation actions describe the same degree problem. The equivalences below lead to the complete minimum-degree formula.
In Foundations: polynomials, fields, and Galois groups
Explore the diagramHow can several local tests prove irreducibility?
Different local tests constrain the same hypothetical factor degree. Their intersection can be empty even when every modular reduction is reducible.
Explore the diagramHow do two modular factorizations determine S₅?
One prime proves transitivity; another supplies a transposition. Prime degree supplies primitivity, and the two branches together determine the full group.
In Frobenius and factorization modulo primes
Explore the diagramWhen does a reciprocal polynomial have the full signed group?
Passing to inverse pairs halves the degree. Recovering the full group then requires both the permutation group on pairs and independent quadratic extensions.
Explore the diagramCatalan sections: factor reflection, resultants, and full symmetric groups
The irreducibility proof combines root geometry with an integer resultant; a later preprint adds the group in every degree.
In Taylor polynomials and Katz–Rivin questions
Explore the diagramCentral-binomial sections: exact groups and prime reductions
A complete degree classification separates from and determines exactly when an irreducible reduction can occur.
In Taylor polynomials and Katz–Rivin questions
Explore the diagramPositive Laguerre parameters: a proposed complete classification
A recent preprint claims every irreducible and reducible case for . The exact exceptions are checkable; a proof-audit concern in the finite-pruning argument is recorded below.
In Generalized Laguerre polynomials
Explore the diagramLegendre polynomials: irreducibility and all signed permutations
Two preprints claim all-degree irreducibility and the full group , combining resultant estimates with local cycles and the action on opposite root pairs.
In Hermite, Bessel, and Legendre polynomials
Explore the diagramLegendre values: from prime divisibility to base-p digits
A published all-degree formula expresses through central binomial coefficients and gives a recurrence that reads the base-p digits of n.
In Hermite, Bessel, and Legendre polynomials
Explore the diagramFour Jacobi families: modular forms, symmetric groups, and Jacobians
The Kaneko–Zagier families connect modular polynomial factors to an all-degree symmetric-group claim; Zarhin’s published theorem then controls the associated hyperelliptic Jacobians.
Explore the diagramNegative Laguerre parameters: a complete Galois classification
Factor exclusion, local permutations, and the discriminant determine every group in the strip .
In Laguerre polynomials with negative parameters
Explore the diagramWhich new primes create a prescribed Fekete factor?
For a fixed squarefree modulus and cyclotomic order, adjoining one prime is governed exactly by the stabilizer of one cyclotomic-field value.
Explore the diagramBinary factorization, Fourier ambiguity, and irreducibility
Factor reversal converts two nonreciprocal factors into a second binary signal with identical Fourier magnitude. A collision bound and two separate divisor estimates give the claimed reducibility asymptotic.
In Factor reversal for random binary polynomials
Explore the diagramTridiagonal matrices, Galois groups, and spectral uncertainty
Finite-field mixing and Dedekind RH yield an alternating or symmetric Galois group with exponentially high probability. Emmrich’s theorem then turns that arithmetic event into a simultaneous uncertainty inequality for every nonzero vector.
In Characteristic polynomials of random matrices
Explore the diagramMorse geometry and Hilbert specialization require two different inputs
Simple critical points and distinct critical values yield regular -monodromy; the Hilbert property then supplies infinitely many specializations with the same group.
In Critical points and polynomial monodromy
Explore the diagramComposition, intermediate fields, blocks, and the off-diagonal curve
Functional decomposition is equivalent to an intermediate-field obstruction; double transitivity additionally detects irreducibility of .
Explore the diagramFrom critical square classes to every quadratic iterate
At each finite level, square-class independence is equivalent to the full binary-tree Galois group. A 2026 preprint extends a two-level check to every level under explicit parameter conditions.
Explore the diagramRabin’s criterion: a complete finite-field irreducibility certificate
One Frobenius congruence and gcd tests at the maximal proper divisors of the degree give a necessary and sufficient test, and a certified construction of .
In Irreducibility over finite fields
Explore the diagramHow can exponent geometry prove absolute irreducibility?
A polynomial factorization forces a Minkowski sum of lattice polytopes. If the support cannot decompose and monomial factors are excluded, no factorization survives over any field extension.
In Newton polytopes and irreducibility
Explore the diagramA complete proposed classification of reducible f(X) − g(Y)
The 2026 DLS preprint claims an if-and-only-if classification over , including decomposable polynomials: common outer factors, the exact six exceptional families, or the signed quartic Chebyshev pair.
In Polynomials with separated variables
Explore the diagram
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.