No matches. Try fewer words or reset the filters.
Does irreducibility imply a symmetric Galois group?
Scope. Separable polynomials over Q
No. The polynomial is irreducible, but its splitting field is and its group is , acting transitively on four roots. Its transitive group is a proper subgroup of the symmetric group.
References 1
- Milne2022 · Chapter 5Cyclotomic extensions and their automorphism groups.Author’s book page
Can an integral translation always make an irreducible polynomial Eisenstein?
Scope. Translations x↦x+c with c∈Z
No. The irreducible polynomial is a counterexample. If were Eisenstein at an odd prime , its cubic coefficient would force , but its constant coefficient would be . At two, the constant coefficient is odd when is even and divisible by eight when is odd. This rules out every integral translation; other changes of variable or valuation criteria may still apply.
References 1
- ConradAllPrimes · Theorems 1 and 2Explicit counterexample, proved in the article. The Claimed label records that the cited source is unpublished exposition.Source
How can one refine Newton-polygon restrictions on factor degrees?
Scope. Local factorization of a specified separable polynomial over a p-adic field
Residual polynomials give the first refinement, illustrated above. If a residual factor is repeated, that stage may leave irreducibility undecided; higher Newton polygons refine the associated valuation and residue data. The Guàrdia–Montes–Nart theory gives a terminating local factorization procedure for separable polynomials. Finding shorter irreducibility proofs for particular families remains a separate question.
References 2
- GuardiaMontesNart2012Newton · Introduction; §3 and Theorem 4.18 in arXiv:0807.2620v2Source
- GuardiaMontesNart2011Montes · §2.2–3Source
Does one prime value prove irreducibility?
Scope. Integer polynomials without additional coefficient or root restrictions
No: takes the prime value at . A distance-to-roots bound, a sufficiently large evaluation, or digit restrictions can turn a prime value into an irreducibility criterion.
References 1
- murty2002primevaluesPrecise additional hypotheses for prime-value arguments.Source
Must an irreducible integer polynomial take a prime or unit value?
Scope. Primitive polynomials in Z[x], with integer arguments and without changing variables
No. The polynomial is primitive and has discriminant , so it is irreducible over . For every integer , the product is nonnegative and even; hence is even and at least four. Thus the prime-value criterion is not necessary for irreducibility.
References 1
- ConradIrredQ · §5, p. 5Elementary counterexample, proved here. The Claimed label records that the cited source is unpublished exposition.Source
How small can a uniform large-gap threshold be?
Scope. Pairs satisfying the hypotheses of the large-gap theorem; degree sum δ and squared coefficient weight at most w
Sawin–Shusterman–Stoll define as the smallest uniform threshold for their Theorem 1.2 over pairs with and . Their Question 1.7 asks, for fixed , whether this is ; Question 1.8 asks for the uniform bound . This records the questions as posed in that paper; it is not a claim that all later work has been excluded.
References 1
- sawinshustermanstoll2020 · Questions 1.7 and 1.8Precise definition and proposed threshold questions.Source
Does composition preserve irreducibility?
Scope. Nonconstant polynomials over Q
No. The pair , above is a counterexample. Capelli identifies the missing condition: the inner polynomial minus a root of the outer one must remain irreducible over that root field.
References 1
- AyadMcQuillan2000 · Lemma 1The exact criterion, applied here to an independently expanded example.Source
Does every irreducible rational polynomial remain irreducible modulo some prime?
Scope. Separable irreducible polynomials over Q; good primes preserve degree and give squarefree reduction.
No. For a polynomial of degree , an irreducible reduction at a good prime exists exactly when its Galois group contains an -cycle. The polynomial is a counterexample: it is irreducible over , and its Klein four-group contains no 4-cycle.
References 2
When can a discriminant determine the full Galois group?
Scope. Characteristic different from 2; separable irreducible cubics, or groups already known to contain .
It determines the group for irreducible cubics, and whenever an independent argument has proved . In general it determines only whether .
References 2
- ConradCubicQuartic · Theorems 1.3 and 2.1Source
- Milne2022 · Corollary 4.2(b), p. 58; Example 4.7, p. 60 (published book)Author’s book page
Does a square discriminant preserve the root-set closure for every coefficient set?
Scope. Sets of integer coefficients containing a nonzero element; nonzero constant term; the degree varies.
Is for every such ? The source asks this after Theorem 1. Its general definition allows zero discriminant; the stronger question with nonzero square discriminant requires a separate argument.
References 1
- Hokken2026ZeroTopology · Question following Theorem 1; Corollary 5Source
Which primes divide the content of a double discriminant?
Scope. The generic degree-n polynomial; 1≤k≤n−1; c_n,k is the positive gcd of the integer coefficients of DD_n,k.
The cited conjecture predicts that the prime divisors of are exactly those of . Section 4 gives finer conjectures about their valuations. This concerns the universal discriminant polynomial, not the discriminant of one specialization.
References 1
- AndersonEtAl2025DoubleDiscriminant · Conjectures 1.4 and 4.1Source
Does a repeated root modulo p imply nontrivial inertia?
Scope. Monic integral polynomials over Q
No: modulo is a counterexample, because its root field is unramified at . The order index can account for repeated reduction; the valuation-one theorem excludes this obstruction.
References 2
- Serre1979 · Discriminant and Different, pp. 47–60The published discriminant and ramification theory proves the distinction used in this counterexample.Source
- Milne2020ANT · Remark 2.25; Theorem 3.35Index-squared identity and the ramification criterion.Source
Can the prime-length assumption in Jordan’s cycle criterion be removed?
Scope. Primitive finite permutation groups containing a nontrivial cycle with at least three fixed points
Yes: Jones’s Corollary 1.3 gives containment of without that assumption. The stronger theorem uses the classification of finite simple groups; the primitivity and fixed-point conditions remain essential.
References 1
- Jones2014Cycles · Corollary 1.3Source
How are cyclic and dihedral quartic groups distinguished?
Scope. Separable irreducible quartics over fields of characteristic not 2
For a reducible cubic resolvent, the discriminant first distinguishes the Klein-four case. In the remaining case, the Kappe–Warren criterion tests whether two specified quadratics split over the discriminant quadratic extension.
References 2
- ConradCubicQuartic · Theorem 4.1Source
- KappeWarren1989Quartic · pp. 133–137Source
When are the quadratic extensions independent?
Scope. A specified reciprocal family over a field of characteristic different from 2.
After determining the Galois group of the trace polynomial, the remaining problem is to find relations among the radicands in its splitting field. These square-class relations determine the kernel of the action on inverse pairs.
References 1
Which sparse families admit a uniform ramification argument?
Scope. A specified family over .
The relevant data are the primes at which roots coincide and the resulting multiplicities. A uniform proof requires transitivity and sufficient inertia generators; modular cycle types computed in individual degrees do not suffice.
References 2
When does a truncation family have a limiting Galois-group frequency?
Scope. A specified rational power series, a stated normalization, and n tending to infinity.
Katz–Rivin ask for a structural description of series with convergent Galois-group frequencies. Nguyen-Dang’s version 3 claims counterexamples to universal convergence, while this classification question remains open. The separate article distinguishes arbitrary constructions from arithmetic families.
References 2
- KatzRivinSpeculations · Question 1.1Source
- NguyenDang2026Taylor · Theorem A and §7.16Source
Do positive shifts of the exponential series have symmetric group in density one?
Scope. Each fixed integer ; the polynomials over , as .
Weinbaum’s preprint claims an affirmative answer. This is a density statement for each fixed shift, not an all-degree result.
References 1
- Weinbaum2026ShiftedExponential · Theorem 1.1, arXiv:2610.26873v2Source
Must all three Taylor Galois proportions converge?
Scope. Every coefficient is a nonzero rational number; degrees n≥3 and the natural root actions.
Theorem A prescribes the set of symmetric degrees. Choosing a set without a natural density gives the claimed counterexample, even for an entire function with positive rational coefficients and simple negative roots in every section. The structural part of Katz–Rivin’s question remains separate.
References 2
- KatzRivinSpeculations · Question 1.1Source
- NguyenDang2026Taylor · Theorem A; Corollary 7.6Source
Must the limiting proportion of other groups be zero or one?
Scope. A rational-coefficient Taylor sequence for which all three frequencies exist.
Theorem A gives every triple , . Proposition 6.2 gives the rational-function example with triple .
References 2
- KatzRivinSpeculations · Question 1.2Source
- NguyenDang2026Taylor · Theorem A and Proposition 6.2Source
Do the frequencies converge for every rational generating function?
Scope. A fixed f∈Q(x) regular at zero, with every Taylor coefficient nonzero.
The preprint leaves this question open, including the class . For ,
This identity connects the question to sparse polynomials with a growing exponent. The arbitrary-coefficient construction does not settle it.
References 1
- NguyenDang2026Taylor · §7.16, “Rational functions”, p. 46Source
Can the frequencies fail to converge when all sufficiently large sections are irreducible?
Scope. A series in Q[[x]] with nonzero coefficients and eventually irreducible sections.
The constructed nonconvergent examples use reducible sections. The preprint asks whether one can instead arrange nonconvergence among transitive groups, for example by alternating between symmetric and alternating groups. Prescribing arbitrary alternating degrees is also left open.
References 1
- NguyenDang2026Taylor · §7.16, “Irreducible nonconvergence and alternating prescriptions”, p. 46Source
Is the least irreducible-reduction prime at most n²+n+5?
Scope. Every n≥1; the monic reciprocal Q_n(x)=Σ_{j=0}^n c_j x^(n−j) of the Catalan section.
Sun conjectures a prime for which is irreducible. Knowing the group is gives infinitely many such primes, but does not give this explicit bound.
References 2
- Sun2013CatalanGroups · OEIS A224416, Comments, conjecture (i)Source
- NguyenDang2026Taylor · §7.16, “Classical sections and smaller thresholds”, p. 45Source
Does each central-trinomial section have a small irreducible-reduction prime?
Scope. Every n≥1; central-trinomial coefficients T_j=[z^j](z²+z+1)^j.
Sun asks whether
is irreducible modulo some prime . This would imply rational irreducibility and an -cycle in the Galois group. It is a separate conjecture from the Catalan and central-binomial statements.
References 1
- Sun2013CatalanGroups · OEIS A224416, Comments, conjecture (iii)Source
Which explicit varying-parameter sequences have irreducible Laguerre polynomials?
Scope. over Q, with the sequence α_n specified in advance.
Eventual irreducibility for each fixed parameter does not imply irreducibility when the parameter changes with the degree. A sequence of parameters requires uniform control of factor degrees or a separate argument using its coefficient products.
References 2
Are there only finitely many exceptional parameters in fixed degree ?
Scope. Any fixed number field and fixed .
Yes: the parameters in for which the polynomial is reducible or has Galois group different from form a finite set. The theorem does not automatically provide an effective list of those parameters.
References 1
- HajirWong2006 · Theorem 1(a) and Remark 1Source
Are and always irreducible over ?
Scope. The standard Legendre polynomials and all integers m≥1.
This is Stieltjes’ conjecture in the cited 2014 paper. Deng’s September 2026 preprint claims a complete proof. The proof has not been independently verified here, so the result is recorded as a preprint claim.
References 2
- CullinanHajir2014 · §1Source
- Deng2026Legendre · Theorem 1.1, arXiv:2609.22336v2 (27 September 2026)A preprint claims a complete resolution; this atlas has not independently verified the full proof.Source
Are the Bessel polynomials irreducible in every positive degree?
Scope. over Q, n≥1.
Yes. The Filaseta–Trifonov theorem proves this and permits arbitrary integral intermediate coefficient multipliers with endpoint multipliers ±1.
References 1
- FilasetaTrifonov2002 · Main theoremSource
Are the reduced and full Legendre groups and ?
Scope. , , assuming irreducibility of the degree- pair polynomial over .
This is the two-part group conjecture of Cullinan–Hajir. It concerns the Galois groups, separately from Stieltjes’ irreducibility conjecture. A 2026 preprint claims a complete proof.
References 2
- CullinanHajir2014 · Conjecture 1.5Source
- NguyenDang2026Jacobi · AbstractSource
Are all nonzero zeros of every Hermite Wronskian simple?
Scope. Wronskians of Hermite polynomials with distinct nonnegative indices; zeros over .
Veselov’s conjecture permits a multiple zero at the origin. It asks whether the remainder is squarefree; it does not assert irreducibility. Grosu–Grosu prove it for partitions , with . Felder–Veselov–Nekrasov still state the general problem as open in 2026.
References 3
- FelderHemeryVeselov2012 · §6, Conjecture 1Source
- GrosuGrosu2021 · Conjecture 1 and Proposition 6; arXiv:2007.00065v1Source
- FelderVeselovNekrasov2026 · §5, second paragraphThe 2026 published paper explicitly states that a general proof of simplicity away from zero is still unknown.Source
Which two-part Hermite Wronskians have irreducible nonconstant remainders?
Scope. The probabilists’ normalization , where and .
Grosu–Grosu ask to extend their irreducibility results to further two-part partitions. Their results include and the diagonal when is a square. The constant remainder at is excluded. A blanket statement for all partitions would be false.
References 1
- GrosuGrosu2021 · Introduction, Theorems 1–3, and §10; arXiv:2007.00065v1Source
Can distinct Legendre polynomials share a nonzero root?
Scope. Integers , ; the Legendre polynomials .
The conjecture is that and have no common root other than the forced root at odd indices. Kadets–Mangoubi prove in their version-1 preprint that a fixed nonzero root of belongs to at most members of the sequence. Their Conjecture 1.1 asks for the stronger pairwise statement. The separate all-degree irreducibility claim would imply it; its full proof has not been independently verified here.
References 2
- KadetsMangoubi2026Legendre · Conjecture 1.1, Theorem 1.2, and §1.5 remark; v1Source
- Deng2026Legendre · Theorem 1.1; v2Proposed stronger result, not treated as settled.Source
Does every irreducible reduced Krawtchouk polynomial have full symmetric group?
Scope. , , , and irreducible over .
Cullinan conjectures . The irreducibility assumption is essential; this does not assert that all rational specializations are irreducible.
References 1
- Cullinan2024 · Conjectures 1.2.6 and 4.0.3; arXiv:2212.07539v1Source
Are all four Kaneko–Zagier families irreducible with symmetric Galois group?
Scope. Integers , , , over .
Define the shifted Jacobi polynomial
The conjecture asks whether every in these four families is irreducible with Galois group . These are the Jacobi normalizations of the Kaneko–Zagier families after their forced elliptic factors are removed. The 2026 preprint claims the full result; it is not used here as an established theorem.
References 3
- MahlburgOno2004 · Conjecture on p. 40Source
- CullinanHajir2017 · Conjecture 1.4Source
- NguyenDang2026Jacobi · Abstract; version 1Source
Is irreducible for every and ?
Scope. Integers and , over .
Set
Hajir’s first conjecture asks whether this polynomial is irreducible for every such pair. The published ranges and the recent uniform preprint claim do not by themselves settle every pair.
References 3
- Hajir2009 · Conjecture 1.1Source
- JindalNairShorey2024 · AbstractSource
- NguyenDang2026UniformLaguerre · AbstractSource
If is irreducible, must its group contain ?
Scope. , , assuming irreducibility over .
This is Hajir’s second conjecture. Equality with is not asserted: the discriminant can be a square.
Which Laguerre polynomials remain irreducible under every admissible coefficient modification?
Scope. Integers , ; all with and ; irreducibility over .
Classify the pairs for which every polynomial
with the stated endpoint conditions is irreducible. This is the admissible modification problem for Hajir’s family. The pair is excluded: taking and gives . Later work proves eventual results for each fixed and further explicit small-parameter results; the full classification remains open.
References 3
- Hajir2009 · Question 8.1Source
- BanerjeeBera2020Modifications · AbstractSource
- ShoreySinha2022II · AbstractSource
Is the normalized Eulerian polynomial irreducible for every index n≥3?
Scope. The classical r=1 Euler–Frobenius specialization over Q; remove x+1 at even indices.
The prime and prime-plus-one cases and the general large-factor bound are proved above. The all-index statement is a conjecture in the cited 1974 source; this status does not exclude subsequent advances.
References 2
- SharmaStraus1974 · p. 266 and Theorem 6Source
- Heidrich1984EulerianGeneral large-factor results.Source
For which indices is the group the full signed-permutation group?
Scope. The separable reciprocal polynomial , of degree 2m.
The group is determined by the action on the degree-m trace polynomial and the rank of the square classes of the quadratic radicands. The index-five example computes both; this computation does not give a uniform argument.
References 1
Is every even Bernoulli polynomial irreducible over Q?
Scope. The standard Bernoulli polynomial B_n(x), for every even n≥2; explicitly described as a conjecture by Patel–Siksek (2017), §3.
Carlitz’s criterion proves irreducibility for infinite sets of indices. The unconditional derangement theorem does not settle the general question. The cited paper states the general assertion as a conjecture.
References 2
- PatelSiksek2017Powers · §3, immediately after Proposition 3.1Source
- Carlitz1952BernoulliEulerSource
What are the Galois groups of the normalized polynomials?
Scope. A stated parity class in the Bernoulli or Appell Euler family, with an explicit squarefree normalization.
The degree-five Euler example shows that the choice of normalization matters. The group on pairs and the kernel of the corresponding quadratic extensions are separate parts of the problem.
References 2
Which Bernoulli or Euler polynomials have repeated roots?
Scope. The standard Appell families B_n and E_n over characteristic zero, n≥1.
None of the Bernoulli polynomials does. The unique Euler exception is , with factorization displayed above.
References 3
- Dilcher2008MultipleZeros · Theorem 2 and §4Source
- Brillhart1969Source
- DLMFBernoulliEuler · §24.12(iv)Source
Are the diagonal higher-order Bernoulli polynomials irreducible after removing the forced factor?
Scope. B_n^(n) for even n≥2; B_n^(n)/(x−n/2) for odd n≥3, over Q.
This is Adelberg’s conjecture. Degree one is excluded from the quotient formulation because it leaves a constant. The ordinary odd Bernoulli normalization is a different problem.
References 2
- AdelbergFilaseta2002 · p. 22, first paragraphSource
- Adelberg1998Newton · §5Source
Is every normalized prime-conductor Fekete polynomial irreducible?
Scope. Primes ; the quadratic-character quotient specified in the linked normalization; base field .
For a prime , set , where is the Legendre symbol, and let be the specified monic reciprocal quotient of this quadratic-character polynomial. Write , where for and for .
Is always irreducible over ? For this family, Corollary 4.2 proves that this is equivalent to irreducibility of . Mináč–Nguyen–Tân verify both for . This is weaker than their full wreath-product conjecture. Varjú–Xu still describe the all-prime irreducibility assertion as conjectural in 2026.
References 2
- MinacNguyenTan2023 · Corollary 4.2 and Remark 4.15 in arXiv:2111.05256v3Irreducibility is discussed in Remark 4.15 as a consequence of Conjecture 4.13; it has no separate numbered conjecture here.Source
- VarjuXu2026 · Introduction, paragraph before Problem 1.2Current independent source describing the classical Fekete irreducibility conjecture.Source
Does every normalized prime-conductor Fekete polynomial have the full wreath-product group?
Scope. Primes ; the quadratic-character quotient specified in the linked normalization; ; base field .
For a prime , set , where is the Legendre symbol, and let be the specified monic reciprocal quotient of this quadratic-character polynomial. Write , where for and for .
The cited conjecture predicts , acting on the roots arranged in inverse pairs. This predicts both irreducibility and a maximal quadratic kernel. It remains a conjecture in the cited version; finite computations do not prove the statement for all primes.
References 1
- MinacNguyenTan2023 · Conjecture 4.13 in arXiv:2111.05256v3Source
Which cyclotomic factors occur for principal characters?
Scope. Squarefree n>1; d>1 with d not dividing n.
Set . The conjecture says that exactly when the numbers
are equal for all residue classes with . Equal counts imply divisibility; the converse is conjectural.
References 1
- ChidambaramMinacNguyenTan2025 · Proposition 2.9 and Conjecture 2.11Source
Is the semiprime remainder irreducible?
Scope. Principal characters; with odd primes ; the specified quotient ; base field .
Let for odd primes , and put . Use the quotient
with the explicit set in the semiprime normalization. The indicated divisibility is proved; whether these are all cyclotomic factors is conjectural.
Conjecture 6.9 asserts that this is irreducible over . The source verifies all such .
References 1
- ChidambaramMinacNguyenTan2025 · Conjecture 6.9 and the preceding computational statement, p. 86Source
What is the semiprime Galois group?
Scope. Principal characters; with odd primes ; the specified quotient ; ; base field .
Let for odd primes , and put . Use the quotient
with the explicit set in the semiprime normalization. The indicated divisibility is proved; whether these are all cyclotomic factors is conjectural.
Define by , with . The proposed groups are and
where adds the coordinates. Both predictions hold for all such .
References 1
- ChidambaramMinacNguyenTan2025 · Proposition 3.7, Questions 7.2 and 7.6, and Propositions 7.3 and 7.7Source
What are the cyclotomic multiplicities for quadratic characters?
Scope. Nontrivial fundamental discriminants Δ; all d≥1.
Determine . This includes factors whose orders do not divide ; multiplicities can exceed one.
References 1
- MinacNguyenTan2024 · Question 3.9 and §§4–10 in arXiv:2206.11778v2Source
Is the quadratic-character remainder irreducible?
Scope. Nontrivial fundamental discriminants ; ; base field .
For , put
where the symbol is the Kronecker symbol. Let be the monic polynomial obtained from by removing every actual cyclotomic factor with its full multiplicity; see the exact remainder definition. When , is irreducible over ? Conjecture 10.6 predicts one irreducible non-cyclotomic factor. This extends the prime-conductor question to composite conductors.
References 1
- MinacNguyenTan2024 · Conjecture 10.6 in arXiv:2206.11778v2Stated here only for nonconstant remainders.Source
Does the square discriminant give the only group restriction?
Scope. Δ=−3p with p≡5 mod8 prime.
Define
The source proves , where is summation. Is this containment always an equality?
References 1
- MinacNguyenTan2024 · Definition 10.3, Proposition 10.4, Proposition 11.12, Corollary 11.13, and §11.5 in arXiv:2206.11778v2A precise subcase of the generalized Galois-group problem; the proven containment is distinguished from the conjectural equality.Source
Are all interior binomial truncations irreducible?
Scope. Integers ; .
This is the conjecture recorded again by Laishram–Yadav in 2024. A theorem for each fixed degree and sufficiently large upper index does not prove it for all pairs.
References 1
- LaishramYadav2024Truncated · AbstractSource
Does every sextic truncation with n≥11 have group S₆?
Scope. , integers .
This conjecture of Filaseta–Moy is restated by Klahn–Technau in 2023. Only finitely many exceptions are possible, but the cited theorem does not determine them. The exceptional group at explains the lower bound.
References 2
- FilasetaMoy2018 · §1, preprint p. 3Source
- KlahnTechnau2023Truncated · §1, conjecture and Theorem 2, p. 2Source
Is irreducible for every odd prime ?
Scope. The (0,1)-sequence ; rational irreducibility.
Dilcher–Ericksen formulate this conjecture in 2014.
References 1
- DilcherEricksen2014Stern · §8.1, Conjecture 1, p. 99Source
Must every reducible have a cyclotomic factor?
Scope. , with nonconstant.
The conjectured factor is for some .
References 1
- DilcherEricksen2014Stern · §8.2, Conjecture 3, p. 99Source
Is the nonreciprocal part of irreducible or 1?
Scope. ; remove every irreducible reciprocal factor over .
This is a separate conjecture concerning the remaining factor.
References 1
- DilcherEricksen2014Stern · §8.3, Conjecture 4, p. 100Source
Do these cyclotomic factors force divisibility of the index?
Scope. Prime with 2 primitive modulo ; .
Conjecture: if or divides , then .
References 1
- DilcherEricksen2014Stern · §8.2, Conjecture 2, p. 99Source
Do all zeros of have real part less than 1?
Scope. Integers ; complex zeros of the recurrence-defined polynomial .
Define , , and, for integers ,
Must every zero of every , , satisfy ? The preprint proves the weaker exclusion of zeros from . The half-plane conjecture remains stated separately. See this Stern sequence and its distinction from the (0,1)-polynomials.
References 2
- Altizio2025Stern · §1, Conjecture 1 and Theorem 2Source
- DilcherKidwaiTomkins2017Stern · Conjecture 3.1, p. 413Source
Are the coefficients of every unimodal?
Scope. The recurrence-defined sequence S_n in this article; n≥1.
Dilcher–Kidwai–Tomkins ask whether the coefficients increase and then decrease, allowing equalities. This is a coefficient-shape question, separate from prime-index irreducibility and from the -sequence .
References 1
- DilcherKidwaiTomkins2017Stern · Conjecture 3.15, p. 421Source
Must a reducible five-term Newman polynomial have a cyclotomic factor?
Scope. , integers , over .
This is Mercer’s Conjecture 6 (2012), restated as Conjecture 1.2 by Koley–Reddy (2019). Their proved theorem instead guarantees a divisor from the two specified cyclotomic families, assuming a cyclotomic factor exists.
References 2
- Mercer2012Newman · Conjecture 6, p. 5Source
- KoleyReddy2019Cyclotomic · Conjecture 1.2Source
Can vanish for ?
Scope. Touchard polynomials T_n(x), n≥0; conjecture discussed in De Angelis–Marcello (2016).
The conjecture is for every . For , it is equivalent to the absence of rational roots of . At most one additional index is possible.
References 1
- DeAngelisMarcello2016 · §1; Theorem 2 and the discussion following itSource
When is irreducible, and what is its Galois group?
Scope. Touchard polynomials T_n(x), n≥2, over Q.
Determine all factor degrees and the Galois group of . This is stronger than Wilf’s conjecture; the cited source addresses rational roots.
References 1
- DeAngelisMarcello2016 · §1The cited open problem controls only rational roots.Source
Does every algebraic integer become a chromatic root after an integer shift?
Scope. For every algebraic integer α, seek an integer n≥0 and a finite graph G with P_G(α+n)=0.
This is the conjecture. It is known in degrees at most three.
References 2
- CameronMorgan2017 · Conjecture 1.1Source
- Bohn2012Chromatic · Abstract and §§2–4Source
Are positive integer multiples of chromatic roots again chromatic roots?
Scope. If α is a root of some chromatic polynomial, and m≥1, ask whether mα is also a chromatic root.
This is the conjecture. It is distinct from closure under nonnegative integer translation, which is known.
References 1
- CameronMorgan2017 · Proposition 1.3 and Conjecture 1.2Source
Does a random graph have one nonlinear chromatic factor with symmetric group?
Scope. Cameron–Morgan (2017), Conjecture 6.1; the source uses the informal word “typically”.
After the linear factors are removed, the conjectured remaining factor is irreducible with the full symmetric group. A precise probabilistic version must specify the graph model, for example , and the limit .
References 1
- CameronMorgan2017 · §6.1, Conjecture 6.1Source
Which graphs have chromatic polynomials that split completely over Q?
Scope. Finite simple graphs; all factors of P_G(q) are linear over Q.
Chordal graphs have this property, but they are not the only ones. The cited source asks for a characterization.
References 1
- CameronMorgan2017 · §6.1, paragraph after Conjecture 6.1Source
Does every connected matroid have a Tutte polynomial with full symmetric group?
Scope. Finite connected matroids M of positive rank d; Galois group of T_M(x,y) as a polynomial in x over K(y), with char(K)=0.
The proposed group is . The multivariate version is proved; the ordinary bivariate version remains conjectural in the cited 2025 preprint beyond its established families.
References 2
- BohnCameronMuller2012Tutte · Conjecture 9Source
- GoodallJouveSereni2025Tutte · Conjecture 1.1 and §4Source
Which finite groups occur for Ehrhart polynomials?
Scope. Splitting fields of Ehrhart polynomials of arbitrary lattice polytopes over Q
Question 6 asks which groups occur, and specifically whether every finite cyclic group occurs. No irreducibility assumption is imposed. The question restricts inverse Galois theory to polynomials arising from lattice-point counts.
References 1
- FiekerHofmannJoswig2022 · §4, Question 6, p. 7 of the published versionSource
Do all level-one Hecke polynomials have full symmetric group?
Scope. Even k with d=dim S_k(SL_2(Z))>0; every integer m>1.
Maeda’s conjecture predicts that is irreducible and has Galois group . The bound for is verified; the universal assertion remains conjectural in the cited 2026 discussion.
References 2
- GhitzaMcAndrew2012 · Conjecture 1.1; Theorem 1.5Source
- BanerjeeEtAl2026 · §1Source
Do non-CM Galois orbit counts stabilize with the weight?
Scope. Fixed N≥1; even weights k→∞; trivial nebentypus; the new subspace.
Tsaknias asks whether is eventually constant. At squarefree level, Question 2.3 predicts orbits. His additional multiplicativity proposal requires caution: Dieulefait–Pacetti–Tsaknias explain why local Galois actions need not vary independently and do not expect multiplicativity in general.
References 3
- Tsaknias2012 · Questions 2.2–2.3Source
- DieulefaitPacettiTsaknias2021 · Introduction, p. 2836; Remark 4.4Source
- BanerjeeEtAl2026 · §1Source
Are all nonconstant Eisenstein zero polynomials irreducible?
Scope. Even k≥4 with deg(φ_k)>0; ground field Q.
The conjecture predicts irreducibility of . González proves it for , . The general assertion is recorded as conjectural in that source.
References 1
- Gonzalez2022 · §1 and Theorem 1Source
Do Eisenstein zero polynomials have full symmetric group?
Scope. Even k≥4 with d=deg(φ_k)>0; ground field Q.
Mahlburg–Ono record the stronger prediction . The known irreducibility theorem alone does not determine this group.
References 2
- MahlburgOno2004 · §1, p. 40, paragraph before the displayed conjectureSource
- Gonzalez2022 · Theorem 1Source
Can two distinct Eisenstein zero polynomials share a root?
Scope. Distinct even weights k, ℓ≥4; the polynomials φ_k and φ_ℓ defined above.
Griffin and collaborators conjecture . Equivalently, the two Eisenstein series have no common non-elliptic zero modulo . Their Conjecture 3.1 is weaker than the general irreducibility conjecture and is stated separately.
References 1
- GriffinEtAl2021Monomials · Conjecture 3.1 and the preceding paragraph, p. 454Source
What is the order of the exceptional count for monic reciprocal quartics?
Scope. Separable monic reciprocal quartics over Z, with coefficient height H tending to infinity.
The corrected source proves the monic bound for half-degree and leaves open. The nonmonic bound includes quartics.
References 1
- AndersonBertelliODorney2026 · Remark 1.4 and Remark 1.6, v2Explicit low-degree exception.Source
Are irreducible exceptions negligible in every fixed degree?
Scope. Monic integer polynomials of fixed degree 5≤n≤39 and coefficient height H→∞.
Does hold throughout this range? Here excludes reducible polynomials. The cited preprint proves the claim for ; the cubic and quartic cases were known earlier. Its twisted Chowla conjecture would cover , leaving smaller degrees to other arguments.
References 2
- AndersonEtAl2026StrongVdW · Conjecture 1.1; Theorems 1.2 and 1.4; Conjecture 1.6; §1.3Source
- ChowDietmann2020 · Introduction and the cubic and quartic counting resultsSource
Can one prove full symmetric groups for small fixed coefficient laws?
Scope. Independent bounded coefficients over Q, with the zero-constant obstruction excluded.
The entropy hypothesis of the cited preprint excludes small-support laws, including fair signs. For these laws, the stated estimate gives no bound for the square-discriminant probability.
References 1
- BlacharBreuillardKozma2026 · Introduction after Theorem 1.1The authors discuss the entropy assumption as a limitation of their method.Source
How short can the prime interval be?
Scope. A prime P sampled uniformly from (d,H(d)], where this interval contains at least one prime.
Set
Varjú–Xu ask for the probability that this polynomial is irreducible after its linear factors are removed. Assuming RH for the Dedekind zeta functions of all number fields, they prove
when ; here counts primes at most . The behavior in shorter intervals is the open problem. The endpoint gives the classical Fekete family, whose additional linear factors must also be removed.
References 1
- VarjuXu2026 · Problem 1.2 and Corollary 1.3The random-prime truncated model is different from the all-prime classical Fekete conjecture.Source
Does the full symmetric conclusion hold in characteristic two?
Scope. Fixed q a power of two and d≥1; independent uniform coefficients in F_q[t] of degree at most d; polynomial degree n→∞.
Does ? Entin proves this for odd . Remark 1.4 explains why the discriminant argument does not extend to characteristic two.
References 2
- Entin2025RationalFunction · Corollary 1.1 and Remark 1.4Source
- EntinPopov2024 · Remark 1.7Explicitly expects the full symmetric conclusion without the odd-characteristic restriction.Source
Does irreducibility hold with probability tending to one along all degrees?
Scope. Fair independent ±1 coefficients over Q, with degree n tending to infinity.
The cited Littlewood paper formulates the all-degree conjecture and proves irreducibility with probability tending to one along a subsequence. The all-degree theorem of Breuillard–Varjú assumes Riemann hypotheses for Dedekind zeta functions.
References 1
- BarySorokerHokkenKozmaPoonen2025 · Equation (1.1), Theorems 1.1–1.2Source-scoped conjecture and proved subsequence.Source
Does the binary model have full symmetric group with probability tending to one?
Scope. Monic binary polynomials over Q with constant term 1 and independent fair internal coefficients.
The cited preprint states a high-probability irreducibility theorem. A full- theorem also requires control of the transitive group and the discriminant square class.
References 1
- Kogler2026 · Theorem 1.1Scope of the cited result.Source
Does irreducibility hold unconditionally for every fixed entry law?
Scope. Independent entries of any fixed nonconstant finitely supported law on Z, with n tending to infinity.
Eberhard’s Conjecture 1.1 concerns irreducibility for arbitrary fixed entry laws. His general theorem assumes ERH, and the unconditional theorem requires uniformity modulo four distinct primes. In particular, the latter theorem does not cover fair signs. Full is a further question.
References 1
- Eberhard2022 · Conjecture 1.1; Theorems 1.2–1.3Exact conjectural and proved scopes.Source
Are reducible characteristic polynomials the main exception for matrices of bounded height?
Scope. Fixed matrix size n≥2; integer entries of absolute value at most T; T→∞.
Let count matrices whose characteristic polynomial has group different from , and those with reducible characteristic polynomial. Anderson–O’Dorney conjecture
The lower bound comes from integer eigenvalues. Their general upper bound is . The size is fixed here; this is a different problem from bounded entries and growing dimension.
References 2
- AndersonODorney2026Matrices · Conjecture 1.2; Theorems 1.3 and 2.1The reducible-count prediction is attributed there to Rivin, Conjecture 12.Source
- Rivin2008 · Conjecture 12Source
When does the Galois group equal the full wreath product with high probability?
Scope. Growing-degree reciprocal model under the hypotheses of Hokken–Koukoulopoulos.
The preprint allows and as alternatives. Determining their probabilities or proving that occurs with probability tending to one for particular laws requires further information beyond irreducibility and a nonsquare discriminant of .
References 1
- HokkenKoukoulopoulos2025 · Theorem A and §14, v2Exact surviving group alternatives.Source
Can the finite exceptional parameters be determined effectively?
Scope. A specified one-parameter family over a fixed number field
A finiteness theorem need not determine the exceptional parameters effectively. Hajir–Wong discuss this difficulty for their curves; the 2026 unit-specialization theorem also leaves a finite set ineffective. For a given family, the problem reduces to determining rational or integral points on the associated curves.
References 2
- HajirWong2006 · Remark 1Source
- SiksekStoll2026 · Remark following Theorem 3Source
Are the exceptional dynatomic specializations finite for every period n>4?
Scope. Φ_n(T,x) for x²+T; specialization T=c∈Q
Krumm proposes finiteness for every and proves it for . Determining each exceptional set explicitly is a further problem.
References 1
- Krumm2019Dynatomic · Problem 1.3, discussion before Theorem 1.4, and §9Source
Which covers have only finitely many reducible fibers at algebraic points of bounded degree?
Scope. A fixed cover over a number field, with a specified bound on the degree of the parameter
One must account for fibers with a rational point over the parameter field. Kadets–Neftin study finiteness after these unavoidable exceptions are removed, and give bounds in terms of branching and monodromy. Their 2026 preprint provides a starting point for sharper bounds and explicit exceptional sets in particular families.
References 1
- KadetsNeftin2026Algebraic · Introduction, Theorems 1.1–1.3, and §1.2Source
Do separable specializations retain the generic group?
Scope. The characteristic-zero Morse family X³−3X−T over Q
No. At the polynomial is reducible, and at it is irreducible with group . Both fibers are separable. Hilbert irreducibility gives many full-group fibers, with possible exceptional specializations.
References 1
- Serre2007Topics · §3.3 and §4.4Specialization framework; the two counterexamples are calculated in this article.Source
Which nontrivial groups have a one-parameter generic polynomial over Q?
Scope. Generic polynomials over Q, with one parameter and universality over every extension field
Exactly . The published classification also identifies the possible splitting fields up to a fractional linear change of parameter.
References 1
- DebesKonigLegrandNeftin2021Generic · Corollary 1.3Source
Does every finite group occur as a Galois group over Q?
Scope. Finite Galois extensions of Q; no fixed degree bound
This is the classical inverse Galois problem. The cited monographs describe known realizations. For a specified group, one can also ask for a realization in a prescribed transitive action.
References 1
- MalleMatzat2018Inverse Galois problem and known realizations.Source
Does every finite group admit a regular realization over Q(T)?
Scope. Regular finite Galois extensions of Q(T)
This is Serre’s Conjecture 4.1.1. A positive answer would imply the ordinary inverse Galois problem by specialization. The conjecture concerns finite groups, not arbitrary profinite groups.
References 1
- Serre2007Topics · Conjecture 4.1.1Source
Can one fixed iterate detect the full arboreal group?
Scope. f_a=x²+a with a∈Q∖{−1,0}; target point 0; Stoll, November 2026.
Is there a fixed such that maximality of implies maximality at every level, for every ? Hindes proposed ; Stoll repeats this as Conjecture 8.1. The values and rule out . Stoll reports the implication from level to level for all of height , in lowest terms with . The conjecture concerns every level and every rational parameter.
References 2
- Hindes2015IterationCurves · §3, Remark 3.4 and following discussion, p. 26Asks whether the first failure of maximality can occur at arbitrarily large levels, and whether all first failures occur before level 5.Source
- Stoll2026Arboreal · Conjecture 8.1, Proposition 8.2, and Remark 8.5; arXiv:2611.14014v1 (10 November 2026)Source
Does every Hilbertian field admit a surjective polynomial arboreal representation of degree at least two?
Scope. Polynomials of degree d≥2 over Hilbertian fields of characteristic zero
No. Dittmann–Kadets give counterexample fields. These counterexamples are compatible with the positive existence results over number fields and with generic maximality at each fixed finite level.
References 1
- DittmannKadets2022 · Theorem 1.2Source
Do iterates of x²+1/c always have at most four irreducible factors?
Scope. c∈Z∖{0,−1}; factorization over Q; all iterate depths
Conjecture 1.7 predicts this uniform bound and gives a precise list of factor counts. The bound is attained in known cases.
References 1
- DeMarkEtAl2020Stability · Conjecture 1.7 and Theorem 1.5Source
Does irreducibility of the second iterate imply stability for x²+1/c?
Scope. c∈Z∖{0,−1}; all irreducibility statements over Q
If is irreducible, must every be irreducible? This is Conjecture 1.8, distinct from the conjecture on maximal Galois groups.
References 1
- DeMarkEtAl2020Stability · Conjecture 1.8Source
Does every quadratic polynomial with infinite critical orbit have finite-index arboreal image?
Scope. f=x²+c over a number field K; the forward orbit of 0 is infinite; target point 0
Jones’s conjecture predicts when over a number field has infinite critical orbit. It allows a proper group at early levels. This is the polynomial case of Conjecture 3.11; the 2026 quadratic preprint still cites the finite-index problem as conjectural.
References 2
- Jones2013Arboreal · Conjecture 3.11, specialized to x²+cSource
- HendersonJuulLattinMercadoSchaefer2026 · Introduction; arXiv:2603.25899v1Source
Are all quadratic Gleason polynomials irreducible?
Scope. G_n(c) over Q, for every integer n≥1
The conjecture asks whether the exact-period parameters form a single Galois orbit for every . Verification through is recorded by Ramadas; the 2026 necklace paper still states the general conjecture.
References 2
- Ramadas2024Moduli · IntroductionSource
- BakerChenLiQian2026Necklaces · Introduction, footnote 1Source
Do all quadratic Gleason polynomials have full symmetric Galois group?
Scope. Every integer n≥1; the reduced exact-period polynomial G_n over Q
Define , , and . The conjecture asserts that is irreducible and
Schleicher’s Conjecture 7.2 is interpreted here for these reduced polynomials. Its preceding displayed definition introduces squares; the article gives the normalization calculation. Periods three and four have groups and , respectively, by the displayed examples.
References 1
- Schleicher2017Galois · Conjecture 7.2 and preceding definition, p. 28Reduced-polynomial interpretation, not a literal repetition of the source formula.Source
Are the normalized Misiurewicz polynomials irreducible?
Scope. d,m≥2; n≥1; ζ≠1 a d-th root of unity; base field Q(ζ)
Conjecture 1.1 asserts irreducibility of . Even the full quadratic family remains unresolved in the cited 2026 paper. Removing lower-period factors and fixing are part of the statement.
References 2
- BenedettoGoksel2024UnitsII · Conjecture 1.1Source
- BenedettoGoksel2026NonUnit · Introduction before Question 1.1Source
Are the remaining Misiurewicz values always non-units?
Scope. m≥2; 1≤ℓ<n with ℓ|n; c₀ a root of quadratic G_{m,n}
Must fail to be an algebraic unit? The 2026 result covers prime under irreducibility assumptions, and leaves the general case open.
References 2
- BenedettoGoksel2026NonUnit · Introduction and Theorem 1.3Source
- BenedettoGoksel2024UnitsII · Conjecture 1.3Source
Determine the Galois groups of Misiurewicz polynomials.
Scope. Normalized G_{d,m,n}^ζ over Q(ζ), with d,m≥2, n≥1, ζ^d=1 and ζ≠1
For , let be the monic polynomial whose roots have exact critical tail , period , and collision relation , where . Determine its permutation group over . The article gives the normalization removing periodic critical parameters. The general irreducibility problem remains open; the symmetric-group conjecture for quadratic Gleason polynomials is a separate question.
References 1
- BenedettoGoksel2024UnitsII · Equation (2), Conjecture 1.1 and the following discussionSource
Which prescribed supports admit irreducibles over a fixed finite field?
Scope. A specified finite field, degree, and support
The counting formula proves existence without coefficient restrictions. A prescribed support or coefficient pattern may force factors, and existence must then be studied for that pattern. Exact certificates can establish individual cases; a general result requires a uniform argument.
Can any one coefficient be prescribed?
Scope. Every prime power , degree , position , and value .
There is a monic irreducible polynomial of degree over with coefficient at , except when , or when is even and . These are the only exceptions. Requiring a primitive root is a different problem with additional multiplicative conditions.
References 1
- TuxanidyWang2018 · Theorem 1.1Source
Which coefficient positions allow stronger bounds?
Scope. Fixed finite field, growing degree, and a specified family of prescription patterns
For a specified pattern of positions and values, one can ask for a larger proportion of prescribed coefficients, an asymptotic count, or an efficient construction. The bounds above establish sufficient ranges; they need not be optimal or the strongest known for every pattern.
References 2
- Ha2016 · Theorem 1.1 and Corollary 1.2Source
- Pollack2013Prescribed · Corollary 2Source
Can degree and coefficient restrictions vary simultaneously?
Scope. A specified sequence of fields, degrees, and allowed coefficient sets
The problem depends on which of and the sets vary. Cheng’s theorem allows increasing degree with large allowed sets, whereas the square-coefficient theorem fixes the degree. For a specified model, one can seek estimates uniform in both parameters or compare the ranges of these results. This formulation does not assert that every intermediate regime is open.
References 2
- Cheng2025Restricted · Theorem 1.1Source
- BarySorokerShmueli2026Squares · Theorems 1–2Source
Does every finite extension have a primitive normal element?
Scope. Every prime power and integer .
Yes. Lenstra and Schoof proved the primitive normal basis theorem; Cohen and Huczynska gave a later proof without computer calculations.
References 2
- LenstraSchoof1987PrimitiveNormal · Main theoremSource
- CohenHuczynska2003PrimitiveNormal · Main theoremSource
Does every finite extension have a primitive completely normal element?
Scope. Every prime power and integer ; the Morgan–Mullen conjecture.
Published results include the range in which the largest divisor of coprime to the characteristic is smaller than . Hellwig claims a proof for all extensions in arXiv:2610.36534v1 (October 2026), using character sums, finite computations, and a reported Lean formalization. The general result is listed as a preprint claim.
References 3
- MorganMullen1996CompletelyNormalSource
- GarefalakisKapetanakis2019PCNSource
- Hellwig2026MorganMullen · Theorem 1.2 and abstractSource
How does the error depend on the degree and the coefficient restrictions?
Scope. Families over in which the degree, field size, or number of free coefficients varies.
The short-interval theorem above fixes the degree when taking the large-field limit. For a different regime, one must control the degree dependence of the error and compute the relevant monodromy. Establishing a limit for one family does not give a uniform theorem for all coefficient restrictions.
References 2
- BankBarySorokerRosenzweig2015 · Theorem 2.3Source
- Entin2021RestrictedSource
Does every binary degree admit an irreducible trinomial or pentanomial?
Scope. Every degree n≥2 over F_2; the support may depend on n.
The conjecture is . Even weights are impossible, and degrees divisible by eight require at least five terms.
References 2
- GathenNocker2005 · Conjecture 2.5Source
- MullenPanario2013 · Conjecture 3.4.30Source
Do four nonzero terms suffice over every finite field with more than two elements?
Scope. Every prime power q≥3 and degree n≥2.
The assertion is . It asks for at least one irreducible polynomial in each degree, without fixing the positions or values of its coefficients.
References 2
- GathenNocker2005 · Conjecture 2.5Source
- MullenPanario2013 · Conjecture 3.4.31Source
Can the lower-degree part always have degree at most ?
Scope. Every prime power q and degree n≥2.
The question asks for an irreducible with . The degree bound is logarithmic; the coefficients of are free.
References 2
- GathenNocker2005 · Conjecture 2.8Source
- MullenPanario2013 · Conjecture 3.4.35Source
When are all irreducible factors of a cyclotomic polynomial trinomials?
Scope. Prime powers , integers with , and exactly three nonzero terms in every factor of .
Zhu and Wu claim a complete classification in arXiv:2611.00647v2 (November 2026). The condition concerns a single cyclotomic polynomial; it is stronger than asking for one sparse irreducible of its degree, and different from requiring all factors of to be sparse.
References 1
- ZhuWu2026CyclotomicTrinomials · Theorems 1.1 and 1.3Source
Which coefficient conditions imply absolute irreducibility when the Newton polytope decomposes?
Scope. A fixed multivariate support and a specified coefficient field
A decomposition of the polytope gives possible supports of factors, but does not determine whether those factors exist. For a specified family, one can study the reducibility locus in coefficient space or combine the support conditions with differential or lifting methods. The question concerns criteria adapted to that family, rather than a general factorization algorithm.
References 3
Which pairs f(x)−g(y) are reducible over the complex numbers?
Scope. Nonconstant complex polynomials of degree at least two
A full classification is claimed in Behajaina–König–Neftin’s March 2026 preprint, Theorem 1.1. The published exceptional families are described by Cassou-Noguès and Couveignes.
References 2
- BehajainaKonigNeftin2026DLS · Theorem 1.1Source
- CassouNoguesCouveignes1999 · §5Source
Is irreducibility over Q decidable in polynomial time?
Scope. Dense univariate polynomials given by rational coefficients in binary
Yes. LLL gives polynomial-time factorization in the degree and coefficient bit size. The bound applies to dense binary input; it does not give the same complexity for every sparse encoding or extension-field representation.
Can the 2026 generic composition bound be extended to arbitrary input?
Scope. Algebraic modular composition over a field; the two-relation-matrix method
For each degree- modulus , Theorem 1.3 supplies a nonempty Zariski-open set of coefficient vectors for on which the faster bound holds. The algorithm can detect failure of its genericity conditions and fall back on another method. The authors explicitly leave a Las Vegas reduction for arbitrary input to future work. A nonempty Zariski-open set over an algebraic closure need not contain a point over a small finite base field; “generic” must not be silently replaced by “every.”
References 1
- NeigerSalvySchostVillard2026 · Theorem 1.3 and following paragraphSource
Can bounded individual degree give a faster irreducibility test?
Scope. An n-variable, s-sparse polynomial of individual degree at most d; field costs stated separately
Chuyoon–Shpilka ask for a deterministic irreducibility test in time . Their full manuscript states this question in §10; the published conference paper gives the sparse-divisor and full-factorization algorithms discussed above. A proper factor may be denser than the input, and a list of circuits containing all factors can also contain polynomials that do not divide the input.
References 2
- ChuyoonShpilka2026 · §10, irreducibility-testing questionSource
- BhattacharjeeKotharyRaiSaraf2026 · Theorem 1.1; §1.1, spurious candidatesSource
How can a computed group be certified?
Scope. Reproducible computations for explicit polynomial families
Short certificates and verifiers for subgroup containment and noncontainment can simplify computations in a specified family. The quartic example illustrates such a certificate. The problem is to find suitable certificates for the chosen family, rather than to establish that Galois-group certification is possible.
References 2
- FiekerKlueners2014 · Section 7Source
- MagmaGaloisDocumentation · GaloisProofSource
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.