Questions

Known results, conjectures, and open problems.

All questionsBrowse by family
Settled: proved in published work. Claimed: a proof is given or claimed in a preprint or unpublished work. Open: an unresolved question or conjecture in published work or a preprint. Research direction: a suggested topic for further study. Status reflects the cited sources.
SettledFoundations

Does irreducibility imply a symmetric Galois group?

Scope. Separable polynomials over Q

No. The polynomial x4+1=Φ8(x)x^4+1=\Phi_8(x) is irreducible, but its splitting field is Q(ζ8)\mathbb Q(\zeta_8) and its group is (Z/8Z)×≅C2×C2(\mathbb Z/8\mathbb Z)^\times\cong C_2\times C_2, acting transitively on four roots. Its transitive group is a proper subgroup of the symmetric group.

References 1
Related article →Discuss this question →
ClaimedIrreducibility methods

Can an integral translation always make an irreducible polynomial Eisenstein?

Scope. Translations x↦x+c with c∈Z

No. The irreducible polynomial F=x4−10x2+1F=x^4-10x^2+1 is a counterexample. If F(x+c)F(x+c) were Eisenstein at an odd prime pp, its cubic coefficient would force p∣cp\mid c, but its constant coefficient would be 1(modp)1\pmod p. At two, the constant coefficient is odd when cc is even and divisible by eight when cc 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
Related article →Discuss this question →
SettledIrreducibility methods

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
Related article →Discuss this question →
SettledIrreducibility methods

Does one prime value prove irreducibility?

Scope. Integer polynomials without additional coefficient or root restrictions

No: (x−1)(x+1)(x-1)(x+1) takes the prime value 33 at x=2x=2. A distance-to-roots bound, a sufficiently large evaluation, or digit restrictions can turn a prime value into an irreducibility criterion.

References 1
Related article →Discuss this question →
ClaimedIrreducibility methods

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 f=x2+x+4f=x^2+x+4 is primitive and has discriminant −15-15, so it is irreducible over Q\mathbb Q. For every integer aa, the product a(a+1)a(a+1) is nonnegative and even; hence f(a)f(a) 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
Related article →Discuss this question →
OpenIrreducibility methods

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 Nopt(δ,w)N_{\mathrm{opt}}(\delta,w) as the smallest uniform threshold for their Theorem 1.2 over pairs with deg⁡c+deg⁡d=δ\deg c+\deg d=\delta and ∥c∥22+∥d∥22≤w\|c\|_2^2+\|d\|_2^2\le w. Their Question 1.7 asks, for fixed δ>1\delta>1, whether this is Oδ(log⁡w)O_\delta(\log w); Question 1.8 asks for the uniform bound O(δlog⁡w)O(\delta\log w). This records the questions as posed in that paper; it is not a claim that all later work has been excluded.

References 1
Related article →Discuss this question →
SettledIrreducibility methods

Does composition preserve irreducibility?

Scope. Nonconstant polynomials over Q

No. The pair x2−8x^2-8, x2−3x^2-3 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
Related article →Discuss this question →
SettledGalois group

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 nn, an irreducible reduction at a good prime exists exactly when its Galois group contains an nn-cycle. The polynomial x4+1x^4+1 is a counterexample: it is irreducible over Q\mathbb Q, and its Klein four-group contains no 4-cycle.

References 2
Related article →Discuss this question →
SettledGalois group

When can a discriminant determine the full Galois group?

Scope. Characteristic different from 2; separable irreducible cubics, or groups already known to contain AnA_n.

It determines the group for irreducible cubics, and whenever an independent argument has proved An⊆GA_n\subseteq G. In general it determines only whether G⊆AnG\subseteq A_n.

References 2
Related article →Discuss this question →
OpenGalois group

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 M□(N)=M(N)M^{\square}(\mathcal N)=M(\mathcal N) for every such N\mathcal N? 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
Related article →Discuss this question →
OpenGalois group

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 cn,kc_{n,k} are exactly those of 2gcd⁡(n,k)2\gcd(n,k). Section 4 gives finer conjectures about their valuations. This concerns the universal discriminant polynomial, not the discriminant of one specialization.

References 1
Related article →Discuss this question →
SettledGalois group

Does a repeated root modulo p imply nontrivial inertia?

Scope. Monic integral polynomials over Q

No: x2−18x^2-18 modulo 33 is a counterexample, because its root field is unramified at 33. 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
Related article →Discuss this question →
SettledGalois group

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 AnA_n without that assumption. The stronger theorem uses the classification of finite simple groups; the primitivity and fixed-point conditions remain essential.

References 1
Related article →Discuss this question →
SettledGalois group

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
Related article →Discuss this question →
Research directionGalois group

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
Related article →Discuss this question →
Research directionPolynomial families

Which sparse families admit a uniform ramification argument?

Scope. A specified family xn+anxrn+bnx^n+a_nx^{r_n}+b_n over Q\mathbb Q.

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
Related article →Discuss this question →
Research directionPolynomial families

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
Related article →Discuss this question →
ClaimedPolynomial families

Do positive shifts of the exponential series have symmetric group in density one?

Scope. Each fixed integer a≥1a\ge1; the polynomials Fn,aF_{n,a} over Q\mathbb Q, as n→∞n\to\infty.

Weinbaum’s preprint claims an affirmative answer. This is a density statement for each fixed shift, not an all-degree result.

References 1
Related article →Discuss this question →
ClaimedPolynomial families

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
Related article →Discuss this question →
ClaimedPolynomial families

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 (δ,0,1−δ)(\delta,0,1-\delta), 0≤δ≤10\le\delta\le1. Proposition 6.2 gives the rational-function example with triple (1/2,0,1/2)(1/2,0,1/2).

References 2
Related article →Discuss this question →
OpenPolynomial families

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 P(x)/(1−x)P(x)/(1-x). For n≥deg⁡Pn\ge\deg P,

(1−x)fn=P(x)−P(1)xn+1.(1-x)f_n=P(x)-P(1)x^{n+1}.

This identity connects the question to sparse polynomials with a growing exponent. The arbitrary-coefficient construction does not settle it.

References 1
Related article →Discuss this question →
OpenPolynomial families

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
Related article →Discuss this question →
OpenPolynomial families

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 p≤n2+n+5p\le n^2+n+5 for which Qn mod pQ_n\bmod p is irreducible. Knowing the group is SnS_n gives infinitely many such primes, but does not give this explicit bound.

References 2
Related article →Discuss this question →
OpenPolynomial families

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

Un(x)=∑j=0nTjxn−jU_n(x)=\sum_{j=0}^n T_jx^{n-j}

is irreducible modulo some prime p≤n2+n+5p\le n^2+n+5. This would imply rational irreducibility and an nn-cycle in the Galois group. It is a separate conjecture from the Catalan and central-binomial statements.

References 1
Related article →Discuss this question →
Research directionPolynomial families

Which explicit varying-parameter sequences have irreducible Laguerre polynomials?

Scope. Ln(αn)L_n^{(\alpha_n)} 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
Related article →Discuss this question →
SettledPolynomial families

Are there only finitely many exceptional parameters in fixed degree n≥10n\ge10?

Scope. Any fixed number field KK and fixed n≥10n\ge10.

Yes: the parameters in KK for which the polynomial is reducible or has Galois group different from SnS_n form a finite set. The theorem does not automatically provide an effective list of those parameters.

References 1
Related article →Discuss this question →
ClaimedPolynomial families

Are P2mP_{2m} and P2m+1/xP_{2m+1}/x always irreducible over Q\mathbb Q?

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
Related article →Discuss this question →
SettledPolynomial families

Are the Bessel polynomials irreducible in every positive degree?

Scope. yn(x)=∑j=0n(n+j)!xj/(2j(n−j)!j!)y_n(x)=\sum_{j=0}^n (n+j)!x^j/(2^j(n-j)!j!) over Q, n≥1.

Yes. The Filaseta–Trifonov theorem proves this and permits arbitrary integral intermediate coefficient multipliers with endpoint multipliers ±1.

References 1
Related article →Discuss this question →
ClaimedPolynomial families

Are the reduced and full Legendre groups SmS_m and C2≀SmC_2\wr S_m?

Scope. m≥1m\ge1, δ∈{0,1}\delta\in\{0,1\}, assuming irreducibility of the degree-mm pair polynomial over Q\mathbb Q.

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
Related article →Discuss this question →
OpenPolynomial families

Are all nonzero zeros of every Hermite Wronskian simple?

Scope. Wronskians of Hermite polynomials with distinct nonnegative indices; zeros over C\mathbb C.

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 (n,k,k−1,…,1)(n,k,k-1,\ldots,1), with n≥k≥1n\ge k\ge1. Felder–Veselov–Nekrasov still state the general problem as open in 2026.

References 3
Related article →Discuss this question →
OpenPolynomial families

Which two-part Hermite Wronskians have irreducible nonconstant remainders?

Scope. The probabilists’ normalization R(n,m)R_{(n,m)}, where n≥m≥1n\ge m\ge1 and deg⁡R(n,m)>0\deg R_{(n,m)}>0.

Grosu–Grosu ask to extend their irreducibility results to further two-part partitions. Their results include m=1,2m=1,2 and the diagonal when n+1n+1 is a square. The constant remainder at (2,1)(2,1) is excluded. A blanket statement for all partitions would be false.

References 1
Related article →Discuss this question →
OpenPolynomial families

Can distinct Legendre polynomials share a nonzero root?

Scope. Integers m,n≥1m,n\ge1, m≠nm\ne n; the Legendre polynomials Pn(x)=(2nn!)−1(d/dx)n(x2−1)nP_n(x)=(2^n n!)^{-1}(d/dx)^n(x^2-1)^n.

The conjecture is that PmP_m and PnP_n have no common root other than the forced root 00 at odd indices. Kadets–Mangoubi prove in their version-1 preprint that a fixed nonzero root of PℓP_\ell belongs to at most 2ℓ2\ell 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
Related article →Discuss this question →
OpenPolynomial families

Does every irreducible reduced Krawtchouk polynomial have full symmetric group?

Scope. m≥1m\ge1, δ∈{0,1}\delta\in\{0,1\}, t∈Qt\in\mathbb Q, and Qm(δ,t)Q_m^{(\delta,t)} irreducible over Q\mathbb Q.

Cullinan conjectures Gal⁡(Qm(δ,t)/Q)=Sm\operatorname{Gal}(Q_m^{(\delta,t)}/\mathbb Q)=S_m. The irreducibility assumption is essential; this does not assert that all rational specializations are irreducible.

References 1
Related article →Discuss this question →
ClaimedPolynomial families

Are all four Kaneko–Zagier families irreducible with symmetric Galois group?

Scope. Integers n≥1n\ge1, α∈{−1/3,1/3}\alpha\in\{-1/3,1/3\}, β∈{−1/2,1/2}\beta\in\{-1/2,1/2\}, over Q\mathbb Q.

Define the shifted Jacobi polynomial

Jn(α,β)(x)=∑j=0n(n+αn−j)(n+α+β+jj)xj.J_n^{(\alpha,\beta)}(x)=\sum_{j=0}^n\binom{n+\alpha}{n-j}\binom{n+\alpha+\beta+j}{j}x^j.

The conjecture asks whether every Jn(α,β)J_n^{(\alpha,\beta)} in these four families is irreducible with Galois group SnS_n. 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
Related article →Discuss this question →
OpenPolynomial families

Is Fn,rF_{n,r} irreducible for every n≥1n\ge1 and r≥0r\ge0?

Scope. Integers n≥1n\ge1 and r≥0r\ge0, over Q\mathbb Q.

Set

Fn,r(x)=∑j=0n(n−j+rn−j)xjj!=(−1)nLn(−n−r−1)(x).F_{n,r}(x)=\sum_{j=0}^n\binom{n-j+r}{n-j}\frac{x^j}{j!}=(-1)^nL_n^{(-n-r-1)}(x).

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
Related article →Discuss this question →
OpenPolynomial families

If Fn,rF_{n,r} is irreducible, must its group contain AnA_n?

Scope. n≥1n\ge1, r≥0r\ge0, assuming irreducibility over Q\mathbb Q.

This is Hajir’s second conjecture. Equality with SnS_n is not asserted: the discriminant can be a square.

References 1
Related article →Discuss this question →
OpenPolynomial families

Which Laguerre polynomials remain irreducible under every admissible coefficient modification?

Scope. Integers n≥1n\ge1, r≥0r\ge0; all b0,…,bn∈Zb_0,\ldots,b_n\in\mathbb Z with b0=±1b_0=\pm1 and bn=1b_n=1; irreducibility over Q\mathbb Q.

Classify the pairs (n,r)(n,r) for which every polynomial

Gn,r,b(x)=∑j=0nbj(n−j+rn−j)xjj!G_{n,r,\mathbf b}(x)=\sum_{j=0}^n b_j\binom{n-j+r}{n-j}\frac{x^j}{j!}

with the stated endpoint conditions is irreducible. This is the admissible modification problem for Hajir’s family. The pair (2,3)(2,3) is excluded: taking b0=−1b_0=-1 and b1=b2=1b_1=b_2=1 gives 2G2,3,b(x)=x2+8x−20=(x−2)(x+10)2G_{2,3,\mathbf b}(x)=x^2+8x-20=(x-2)(x+10). Later work proves eventual results for each fixed rr and further explicit small-parameter results; the full classification remains open.

References 3
Related article →Discuss this question →
OpenPolynomial families

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
Related article →Discuss this question →
Research directionPolynomial families

For which indices is the group the full signed-permutation group?

Scope. The separable reciprocal polynomial A~n\widetilde A_n, 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
Related article →Discuss this question →
OpenPolynomial families

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
Related article →Discuss this question →
Research directionPolynomial families

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
Related article →Discuss this question →
OpenPolynomial families

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 Bn(x)/[x(x−1)(x−1/2)]B_n(x)/[x(x-1)(x-1/2)] is a different problem.

References 2
Related article →Discuss this question →
OpenPolynomial families

Is every normalized prime-conductor Fekete polynomial irreducible?

Scope. Primes p≥7p\ge7; the quadratic-character quotient fpf_p specified in the linked normalization; base field Q\mathbb Q.

For a prime p≥7p\ge7, set Fp(x)=∑a=1p−1(a/p)xaF_p(x)=\sum_{a=1}^{p-1}(a/p)x^a, where (a/p)(a/p) is the Legendre symbol, and let fpf_p be the specified monic reciprocal quotient of this quadratic-character polynomial. Write fp(x)=xmgp(x+x−1)f_p(x)=x^m g_p(x+x^{-1}), where m=(p−3)/2m=(p-3)/2 for p≡3(mod4)p\equiv3\pmod4 and m=(p−5)/2m=(p-5)/2 for p≡1(mod4)p\equiv1\pmod4.

Is fpf_p always irreducible over Q\mathbb Q? For this family, Corollary 4.2 proves that this is equivalent to irreducibility of gpg_p. Mináč–Nguyen–Tân verify both for p<104p<10^4. 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
Related article →Discuss this question →
OpenPolynomial families

Does every normalized prime-conductor Fekete polynomial have the full wreath-product group?

Scope. Primes p≥7p\ge7; the quadratic-character quotient fpf_p specified in the linked normalization; m=deg⁡gp=12deg⁡fpm=\deg g_p=\tfrac12\deg f_p; base field Q\mathbb Q.

For a prime p≥7p\ge7, set Fp(x)=∑a=1p−1(a/p)xaF_p(x)=\sum_{a=1}^{p-1}(a/p)x^a, where (a/p)(a/p) is the Legendre symbol, and let fpf_p be the specified monic reciprocal quotient of this quadratic-character polynomial. Write fp(x)=xmgp(x+x−1)f_p(x)=x^m g_p(x+x^{-1}), where m=(p−3)/2m=(p-3)/2 for p≡3(mod4)p\equiv3\pmod4 and m=(p−5)/2m=(p-5)/2 for p≡1(mod4)p\equiv1\pmod4.

The cited conjecture predicts Gal⁡(fp/Q)=C2≀Sm\operatorname{Gal}(f_p/\mathbb Q)=C_2\wr S_m, acting on the 2m2m roots arranged in mm 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
Related article →Discuss this question →
OpenPolynomial families

Which cyclotomic factors occur for principal characters?

Scope. Squarefree n>1; d>1 with d not dividing n.

Set d1=gcd⁡(d,n)d_1=\gcd(d,n). The conjecture says that Φd∣Fnprin\Phi_d\mid F_n^{\mathrm{prin}} exactly when the numbers

#{1≤a≤n:gcd⁡(a,n)=1, a≡r(modd)}\#\{1\le a\le n:\gcd(a,n)=1,\ a\equiv r\pmod d\}

are equal for all residue classes r(modd)r\pmod d with gcd⁡(r,d1)=1\gcd(r,d_1)=1. Equal counts imply divisibility; the converse is conjectural.

References 1
Related article →Discuss this question →
OpenPolynomial families

Is the semiprime remainder irreducible?

Scope. Principal characters; n=pqn=pq with odd primes p>qp>q; the specified quotient fnf_n; base field Q\mathbb Q.

Let n=pqn=pq for odd primes p>qp>q, and put Fnprin(x)=∑1≤a≤n, (a,n)=1xaF_n^{\mathrm{prin}}(x)=\sum_{1\le a\le n,\,(a,n)=1}x^a. Use the quotient

fn(x)=Fnprin(x)x∏d∈SnΦd(x),f_n(x)=\frac{F_n^{\mathrm{prin}}(x)}{x\prod_{d\in S_n}\Phi_d(x)},

with the explicit set SnS_n in the semiprime normalization. The indicated divisibility is proved; whether these are all cyclotomic factors is conjectural.

Conjecture 6.9 asserts that this fnf_n is irreducible over Q\mathbb Q. The source verifies all such n<104n<10^4.

References 1
Related article →Discuss this question →
OpenPolynomial families

What is the semiprime Galois group?

Scope. Principal characters; n=pqn=pq with odd primes p>qp>q; the specified quotient fn(x)=xmgn(x+x−1)f_n(x)=x^m g_n(x+x^{-1}); m=deg⁡gn=12deg⁡fnm=\deg g_n=\tfrac12\deg f_n; base field Q\mathbb Q.

Let n=pqn=pq for odd primes p>qp>q, and put Fnprin(x)=∑1≤a≤n, (a,n)=1xaF_n^{\mathrm{prin}}(x)=\sum_{1\le a\le n,\,(a,n)=1}x^a. Use the quotient

fn(x)=Fnprin(x)x∏d∈SnΦd(x),f_n(x)=\frac{F_n^{\mathrm{prin}}(x)}{x\prod_{d\in S_n}\Phi_d(x)},

with the explicit set SnS_n in the semiprime normalization. The indicated divisibility is proved; whether these are all cyclotomic factors is conjectural.

Define gng_n by fn(x)=xmgn(x+x−1)f_n(x)=x^m g_n(x+x^{-1}), with 2m=deg⁡fn2m=\deg f_n. The proposed groups are Gal⁡(gn/Q)=Sm\operatorname{Gal}(g_n/\mathbb Q)=S_m and

Gal⁡(fn/Q)={C2m⋊Sm,p≡1(modq) or p,q≡1(mod4),ker⁡(Σ)⋊Sm,otherwise,\operatorname{Gal}(f_n/\mathbb Q)=\begin{cases}C_2^m\rtimes S_m,&p\equiv1\pmod q\text{ or }p,q\equiv1\pmod4,\\\ker(\Sigma)\rtimes S_m,&\text{otherwise},\end{cases}

where Σ:C2m→C2\Sigma:C_2^m\to C_2 adds the coordinates. Both predictions hold for all such n<104n<10^4.

References 1
Related article →Discuss this question →
OpenPolynomial families

What are the cyclotomic multiplicities for quadratic characters?

Scope. Nontrivial fundamental discriminants Δ; all d≥1.

Determine rΔ(d)r_\Delta(d). This includes factors whose orders do not divide ∣Δ∣|\Delta|; multiplicities can exceed one.

References 1
Related article →Discuss this question →
OpenPolynomial families

Is the quadratic-character remainder irreducible?

Scope. Nontrivial fundamental discriminants Δ\Delta; deg⁡RΔ>0\deg R_\Delta>0; base field Q\mathbb Q.

For D=∣Δ∣D=|\Delta|, put

FΔ(x)=∑a=1D−1(Δa)xa,F_\Delta(x)=\sum_{a=1}^{D-1}\left(\frac{\Delta}{a}\right)x^a,

where the symbol is the Kronecker symbol. Let RΔR_\Delta be the monic polynomial obtained from FΔ/xF_\Delta/x by removing every actual cyclotomic factor with its full multiplicity; see the exact remainder definition. When deg⁡RΔ>0\deg R_\Delta>0, is RΔR_\Delta irreducible over Q\mathbb Q? Conjecture 10.6 predicts one irreducible non-cyclotomic factor. This extends the prime-conductor question to composite conductors.

References 1
Related article →Discuss this question →
OpenPolynomial families

Does the square discriminant give the only group restriction?

Scope. Δ=−3p with p≡5 mod8 prime.

Define

hp=−F−3pxΦ1Φ3Φp,deg⁡hp=2(p−2).h_p=-\frac{F_{-3p}}{x\Phi_1\Phi_3\Phi_p},\qquad \deg h_p=2(p-2).

The source proves Gal⁡(hp/Q)≤ker⁡(Σ)⋊Sp−2\operatorname{Gal}(h_p/\mathbb Q)\le\ker(\Sigma)\rtimes S_{p-2}, where Σ:C2p−2→C2\Sigma:C_2^{p-2}\to C_2 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
Related article →Discuss this question →
OpenPolynomial families

Are all interior binomial truncations irreducible?

Scope. Integers 1≤r≤n−21\le r\le n-2; Pn,r∈Q[x]P_{n,r}\in\mathbb Q[x].

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
Related article →Discuss this question →
OpenPolynomial families

Does every sextic truncation with n≥11 have group S₆?

Scope. Pn,6(x)=∑j=06(nj)xjP_{n,6}(x)=\sum_{j=0}^6\binom njx^j, integers n≥11n\ge11.

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 n=10n=10 explains the lower bound.

References 2
Related article →Discuss this question →
OpenPolynomial families

Do these cyclotomic factors force divisibility of the index?

Scope. Prime p≥3p\ge3 with 2 primitive modulo pp; mp=2p−1+1m_p=2^{p-1}+1.

Conjecture: if Φp(x)\Phi_p(x) or Φp(−x)\Phi_p(-x) divides an(x)a_n(x), then mp∣nm_p\mid n.

References 1
Related article →Discuss this question →
OpenPolynomial families

Do all zeros of SnS_n have real part less than 1?

Scope. Integers n≥1n\ge1; complex zeros of the recurrence-defined polynomial SnS_n.

Define S0(x)=0S_0(x)=0, S1(x)=1S_1(x)=1, and, for integers k≥1k\ge1,

S2k(x)=xSk(x),S2k+1(x)=Sk(x)+Sk+1(x).S_{2k}(x)=xS_k(x),\qquad S_{2k+1}(x)=S_k(x)+S_{k+1}(x).

Must every zero zz of every SnS_n, n≥1n\ge1, satisfy Re⁡z<1\operatorname{Re}z<1? The preprint proves the weaker exclusion of zeros from ∣z−2∣≤1|z-2|\le1. The half-plane conjecture remains stated separately. See this Stern sequence and its distinction from the (0,1)-polynomials.

References 2
Related article →Discuss this question →
OpenPolynomial families

Are the coefficients of every SnS_n 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 (0,1)(0,1)-sequence ana_n.

References 1
Related article →Discuss this question →
OpenPolynomial families

Must a reducible five-term Newman polynomial have a cyclotomic factor?

Scope. f=1+xs+xr+xm+xnf=1+x^s+x^r+x^m+x^n, integers 0<s<r<m<n0<s<r<m<n, over Q\mathbb Q.

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
Related article →Discuss this question →
OpenPolynomial families

Can Tn(−1)T_n(-1) vanish for n≠2n\ne2?

Scope. Touchard polynomials T_n(x), n≥0; conjecture discussed in De Angelis–Marcello (2016).

The conjecture is Tn(−1)≠0T_n(-1)\ne0 for every n≠2n\ne2. For n≥3n\ge3, it is equivalent to the absence of rational roots of Tn/xT_n/x. At most one additional index is possible.

References 1
Related article →Discuss this question →
Research directionPolynomial families

When is Tn(x)/xT_n(x)/x 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 Tn(x)/xT_n(x)/x. This is stronger than Wilf’s conjecture; the cited source addresses rational roots.

References 1
Related article →Discuss this question →
OpenPolynomial families

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 nαn\alpha conjecture. It is distinct from closure under nonnegative integer translation, which is known.

References 1
Related article →Discuss this question →
OpenPolynomial families

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 G(N,1/2)G(N,1/2), and the limit N→∞N\to\infty.

References 1
Related article →Discuss this question →
OpenPolynomial families

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
Related article →Discuss this question →
OpenPolynomial families

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 SdS_d. The multivariate version is proved; the ordinary bivariate version remains conjectural in the cited 2025 preprint beyond its established families.

References 2
Related article →Discuss this question →
OpenPolynomial families

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
Related article →Discuss this question →
OpenPolynomial families

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 Hk,mH_{k,m} is irreducible and has Galois group SdS_d. The bound k≤14000k\le14000 for T2T_2 is verified; the universal assertion remains conjectural in the cited 2026 discussion.

References 2
Related article →Discuss this question →
OpenPolynomial families

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 NCM(N,k)\mathrm{NCM}(N,k) is eventually constant. At squarefree level, Question 2.3 predicts 2ω(N)2^{\omega(N)} 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
Related article →Discuss this question →
OpenPolynomial families

Are all nonconstant Eisenstein zero polynomials irreducible?

Scope. Even k≥4 with deg(φ_k)>0; ground field Q.

The conjecture predicts irreducibility of φk\varphi_k. González proves it for k=12⋅2ℓk=12\cdot2^\ell, ℓ≥0\ell\ge0. The general assertion is recorded as conjectural in that source.

References 1
Related article →Discuss this question →
OpenPolynomial families

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 Gal⁡(φk/Q)=Sd\operatorname{Gal}(\varphi_k/\mathbb Q)=S_d. The known irreducibility theorem alone does not determine this group.

References 2
Related article →Discuss this question →
OpenPolynomial families

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 gcd⁡(φk,φℓ)=1\gcd(\varphi_k,\varphi_\ell)=1. Equivalently, the two Eisenstein series have no common non-elliptic zero modulo SL2(Z)\mathrm{SL}_2(\mathbb Z). Their Conjecture 3.1 is weaker than the general irreducibility conjecture and is stated separately.

References 1
Related article →Discuss this question →
OpenCounting and probability

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 m≥3m\ge3 and leaves m=2m=2 open. The nonmonic bound includes quartics.

References 1
Related article →Discuss this question →
OpenCounting and probability

Are irreducible exceptions negligible in every fixed degree?

Scope. Monic integer polynomials of fixed degree 5≤n≤39 and coefficient height H→∞.

Does In(H)=on(Hn−1)I_n(H)=o_n(H^{n-1}) hold throughout this range? Here InI_n excludes reducible polynomials. The cited preprint proves the claim for n≥40n\ge40; the cubic and quartic cases were known earlier. Its twisted Chowla conjecture would cover 8≤n≤398\le n\le39, leaving smaller degrees to other arguments.

References 2
Related article →Discuss this question →
Research directionCounting and probability

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
Related article →Discuss this question →
OpenCounting and probability

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

Td,P(x)=∑a=1d(aP)xa.T_{d,P}(x)=\sum_{a=1}^d\left(\frac aP\right)x^a.

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

Pr⁡(Td,P/x irreducible over Q)≥1−Oε(d−1/2+ε)\Pr\bigl(T_{d,P}/x\text{ irreducible over }\mathbb Q\bigr)\ge1-O_\varepsilon(d^{-1/2+\varepsilon})

when H(d)>22π(d)d4H(d)>2^{2\pi(d)}d^4; here π(d)\pi(d) counts primes at most dd. The behavior in shorter intervals is the open problem. The endpoint d=P−1d=P-1 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
Related article →Discuss this question →
OpenCounting and probability

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 Pr⁡(Gf=Sn∣f irreducible)→1\Pr(G_f=S_n\mid f\text{ irreducible})\to1? Entin proves this for odd qq. Remark 1.4 explains why the discriminant argument does not extend to characteristic two.

References 2
Related article →Discuss this question →
OpenCounting and probability

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
Related article →Discuss this question →
Research directionCounting and probability

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-SnS_n theorem also requires control of the transitive group and the discriminant square class.

References 1
Related article →Discuss this question →
OpenCounting and probability

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 SnS_n is a further question.

References 1
Related article →Discuss this question →
OpenCounting and probability

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 Mn(T)M_n(T) count matrices whose characteristic polynomial has group different from SnS_n, and Rn(T)R_n(T) those with reducible characteristic polynomial. Anderson–O’Dorney conjecture

Rn(T)∼Mn(T)≍nTn2−n+1log⁡T.R_n(T)\sim M_n(T)\asymp_n T^{n^2-n+1}\log T.

The lower bound comes from integer eigenvalues. Their general upper bound is Mn(T)≪nTn2−1/2log⁡TM_n(T)\ll_n T^{n^2-1/2}\log T. The size nn is fixed here; this is a different problem from bounded entries and growing dimension.

References 2
Related article →Discuss this question →
Research directionCounting and probability

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 C2≀AmC_2\wr A_m and G2G_2 as alternatives. Determining their probabilities or proving that WmW_m occurs with probability tending to one for particular laws requires further information beyond irreducibility and a nonsquare discriminant of FmF_m.

References 1
Related article →Discuss this question →
Research directionSpecialization and inverse Galois

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
Related article →Discuss this question →
OpenSpecialization and inverse Galois

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 n>4n>4 and proves it for 5,6,7,95,6,7,9. Determining each exceptional set explicitly is a further problem.

References 1
Related article →Discuss this question →
Research directionSpecialization and inverse Galois

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
Related article →Discuss this question →
SettledSpecialization and inverse Galois

Do separable specializations retain the generic group?

Scope. The characteristic-zero Morse family X³−3X−T over Q

No. At T=0T=0 the polynomial is reducible, and at T=1T=1 it is irreducible with group C3C_3. 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
Related article →Discuss this question →
SettledSpecialization and inverse Galois

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 C2,C3,S3C_2,C_3,S_3. The published classification also identifies the possible splitting fields up to a fractional linear change of parameter.

References 1
Related article →Discuss this question →
OpenSpecialization and inverse Galois

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
Related article →Discuss this question →
OpenSpecialization and inverse Galois

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
Related article →Discuss this question →
OpenComposition and iteration

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 NN such that maximality of Gal⁡(fa∘N/Q)\operatorname{Gal}(f_a^{\circ N}/\mathbb Q) implies maximality at every level, for every a∈Q∖{−1,0}a\in\mathbb Q\setminus\{-1,0\}? Hindes proposed N=4N=4; Stoll repeats this as Conjecture 8.1. The values a=2/3a=2/3 and −6/7-6/7 rule out N<4N<4. Stoll reports the implication from level 44 to level 2020 for all a=r/sa=r/s of height max⁡(∣r∣,s)≤106\max(|r|,s)\le10^6, in lowest terms with s>0s>0. 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
Related article →Discuss this question →
SettledComposition and iteration

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
Related article →Discuss this question →
OpenComposition and iteration

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
Related article →Discuss this question →
OpenComposition and iteration

Does irreducibility of the second iterate imply stability for x²+1/c?

Scope. c∈Z∖{0,−1}; all irreducibility statements over Q

If f∘2f^{\circ2} is irreducible, must every f∘nf^{\circ n} be irreducible? This is Conjecture 1.8, distinct from the conjecture on maximal Galois groups.

References 1
Related article →Discuss this question →
OpenComposition and iteration

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 [Aut⁡(T∞):G∞(f,0)]<∞[\operatorname{Aut}(T_\infty):G_\infty(f,0)]<\infty when f=x2+cf=x^2+c 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
Related article →Discuss this question →
OpenComposition and iteration

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 a0(c)=0a_0(c)=0, aj+1(c)=aj(c)2+ca_{j+1}(c)=a_j(c)^2+c, and Gn(c)=∏d∣nad(c)μ(n/d)G_n(c)=\prod_{d\mid n}a_d(c)^{\mu(n/d)}. The conjecture asserts that GnG_n is irreducible and

Gal⁡(Gn/Q)=Sdeg⁡Gn.\operatorname{Gal}(G_n/\mathbb Q)=S_{\deg G_n}.

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 S3S_3 and S6S_6, 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
Related article →Discuss this question →
OpenComposition and iteration

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 Gd,m,nζG_{d,m,n}^{\zeta}. Even the full quadratic family remains unresolved in the cited 2026 paper. Removing lower-period factors and fixing ζ\zeta are part of the statement.

References 2
Related article →Discuss this question →
OpenComposition and iteration

Are the remaining Misiurewicz values always non-units?

Scope. m≥2; 1≤ℓ<n with ℓ|n; c₀ a root of quadratic G_{m,n}

Must Gm,ℓ(c0)G_{m,\ell}(c_0) fail to be an algebraic unit? The 2026 result covers prime ℓ≤1024\ell\le1024 under irreducibility assumptions, and leaves the general case open.

References 2
Related article →Discuss this question →
Research directionComposition and iteration

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 fd,c(z)=zd+cf_{d,c}(z)=z^d+c, let Gd,m,nζG_{d,m,n}^{\zeta} be the monic polynomial whose roots have exact critical tail mm, period nn, and collision relation am+n−1=ζam−1a_{m+n-1}=\zeta a_{m-1}, where aj=fd,c∘j(0)a_j=f_{d,c}^{\circ j}(0). Determine its permutation group over Q(ζ)\mathbb Q(\zeta). 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
Related article →Discuss this question →
Research directionFinite fields

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.

References 3
Related article →Discuss this question →
SettledFinite fields

Can any one coefficient be prescribed?

Scope. Every prime power qq, degree n≥2n\ge2, position 0≤j<n0\le j<n, and value c∈Fqc\in\mathbb F_q.

There is a monic irreducible polynomial of degree nn over Fq\mathbb F_q with coefficient cc at xjx^j, except when j=0,c=0j=0,c=0, or when qq is even and (n,j,c)=(2,1,0)(n,j,c)=(2,1,0). These are the only exceptions. Requiring a primitive root is a different problem with additional multiplicative conditions.

References 1
Related article →Discuss this question →
Research directionFinite fields

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
Related article →Discuss this question →
Research directionFinite fields

Can degree and coefficient restrictions vary simultaneously?

Scope. A specified sequence of fields, degrees, and allowed coefficient sets

The problem depends on which of q,nq,n and the sets AiA_i 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
Related article →Discuss this question →
ClaimedFinite fields

Does every finite extension have a primitive completely normal element?

Scope. Every prime power qq and integer n≥1n\ge1; the Morgan–Mullen conjecture.

Published results include the range in which the largest divisor of nn coprime to the characteristic is smaller than qq. 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
Related article →Discuss this question →
Research directionFinite fields

How does the error depend on the degree and the coefficient restrictions?

Scope. Families over Fq\mathbb F_q 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
Related article →Discuss this question →
OpenFinite fields

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 σq(n)≤4\sigma_q(n)\le4. It asks for at least one irreducible polynomial in each degree, without fixing the positions or values of its coefficients.

References 2
Related article →Discuss this question →
OpenFinite fields

Can the lower-degree part always have degree at most 3+log⁡qn3+\log_q n?

Scope. Every prime power q and degree n≥2.

The question asks for an irreducible xn+hx^n+h with deg⁡h≤3+log⁡qn\deg h\le3+\log_q n. The degree bound is logarithmic; the coefficients of hh are free.

References 2
Related article →Discuss this question →
ClaimedFinite fields

When are all irreducible factors of a cyclotomic polynomial trinomials?

Scope. Prime powers qq, integers m>1m>1 with gcd⁡(m,q)=1\gcd(m,q)=1, and exactly three nonzero terms in every factor of Φm\Phi_m.

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 xm−1x^m-1 to be sparse.

References 1
Related article →Discuss this question →
Research directionSeveral variables

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
Related article →Discuss this question →
SettledAlgorithms and certificates

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.

References 1
Related article →Discuss this question →
Research directionAlgorithms and certificates

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-nn modulus ff, Theorem 1.3 supplies a nonempty Zariski-open set of coefficient vectors for aa 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
Related article →Discuss this question →
OpenAlgorithms and certificates

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 poly⁡(n,sd)\operatorname{poly}(n,s^d). 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
Related article →Discuss this question →
Research directionAlgorithms and certificates

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
Related article →Discuss this question →

Comments

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