Overview

  • Which factors at 00, 11, and βˆ’1-1 occur in the prime-conductor family?
  • Why is irreducibility equivalent to that of its trace polynomial?
  • What would prove the conjectured group C2≀SmC_2\wr S_m?

Definition

For an odd prime pp, let Ο‡p(a)=(a/p)\chi_p(a)=(a/p) be the Legendre symbol and define

Fp(x)=βˆ‘a=1pβˆ’1Ο‡p(a)xa.F_p(x)=\sum_{a=1}^{p-1}\chi_p(a)x^a.

The coefficients encode the quadratic residues modulo pp. These polynomials entered the study of Dirichlet L-functions; their special values also connect to class numbers and generalized Bernoulli numbers. Their coefficients are deterministic and strongly correlated, so theorems about independent random signs cannot be applied directly.

References 1

Normalization

The identity Ο‡p(pβˆ’a)=Ο‡p(βˆ’1)Ο‡p(a)\chi_p(p-a)=\chi_p(-1)\chi_p(a) gives xpFp(xβˆ’1)=Ο‡p(βˆ’1)Fp(x)x^pF_p(x^{-1})=\chi_p(-1)F_p(x). Define

fp(x)={Fp(x)x(1βˆ’x),p≑3(mod4),Fp(x)x(1βˆ’x)2(x+1),p≑1(mod4).f_p(x)=\begin{cases}\dfrac{F_p(x)}{x(1-x)},&p\equiv3\pmod4,\\[6pt]\dfrac{F_p(x)}{x(1-x)^2(x+1)},&p\equiv1\pmod4.\end{cases}

The factors at 11 and βˆ’1-1 have precisely the indicated multiplicities. The result is monic and reciprocal. Write fp=xmgp(x+xβˆ’1)f_p=x^m g_p(x+x^{-1}), with m=(pβˆ’3)/2m=(p-3)/2 or (pβˆ’5)/2(p-5)/2, respectively. For p=3,5p=3,5, one has fp=1f_p=1. For pβ‰₯7p\ge7, irreducibility of fpf_p over Q\mathbb Q is equivalent to irreducibility of gpg_p. This equivalence uses arithmetic special values, not reciprocity alone.

References 1
  • MinacNguyenTan2023 Β· Proposition 2.1, Definition 3.2, and Corollary 4.2Exact forced factors and irreducibility equivalence.Source

Example

Example

The quadratic residues modulo 77 are 1,2,41,2,4, so

F7=x+x2βˆ’x3+x4βˆ’x5βˆ’x6.F_7=x+x^2-x^3+x^4-x^5-x^6.

Dividing by x(1βˆ’x)x(1-x) gives

f7=x4+2x3+x2+2x+1=x2((x+xβˆ’1)2+2(x+xβˆ’1)βˆ’1).f_7=x^4+2x^3+x^2+2x+1=x^2\bigl((x+x^{-1})^2+2(x+x^{-1})-1\bigr).

Thus g7(y)=y2+2yβˆ’1g_7(y)=y^2+2y-1, with roots βˆ’1Β±2-1\pm\sqrt2. Their field is M=Q(2)M=\mathbb Q(\sqrt2), and the quadratic radicands are βˆ’1βˆ“22-1\mp2\sqrt2. Each has norm βˆ’7-7. A square in MM has rational norm equal to a rational square, so neither radicand is a square. Their product is βˆ’7-7, which is not a square in the real field MM. The two square classes are independent, giving [L:M]=4[L:M]=4 and [L:Q]=8[L:\mathbb Q]=8. The group of f7f_7 is therefore C2≀S2C_2\wr S_2.

References 1
  • Cox2012Quadratic extensions and norms; this conductor-seven calculation is explicit.Source

Galois-group conjecture

MinÑč–Nguyen–TΓ’n conjecture that the normalized prime-conductor family has full group C2≀SmC_2\wr S_m, with m=deg⁑gpm=\deg g_p. This is a conjecture in the cited source, supported by structural results and finite computations. The broader generalized-character family can have additional symmetries and a smaller allowed group.

References 2

Trace polynomials and square classes

For a generalized character, first determine the cyclotomic factors and reciprocal symmetry. The remaining polynomial can then be written in terms of x+xβˆ’1x+x^{-1}. This separates the Galois problem into the action on inverse pairs and the quadratic extensions within those pairs. Special values provide square classes; factorizations modulo good primes provide cycle types.

Additional factors, a smaller group on pairs, or a relation among the quadratic radicands can each force a smaller full group.

References 1

Principal characters

For the principal character modulo N>1N>1, the corresponding polynomial is FNprin(x)=βˆ‘1≀a≀N, (a,N)=1xaF_N^{\mathrm{prin}}(x)=\sum_{1\le a\le N,\,(a,N)=1}x^a. MΓΆbius inversion gives

FNprin(x)=βˆ‘d∣NΞΌ(d) xd(1βˆ’xN)1βˆ’xd.F_N^{\mathrm{prin}}(x)=\sum_{d\mid N}\mu(d)\,\frac{x^d(1-x^N)}{1-x^d}.

Each quotient is a finite geometric sum, so the expression is polynomial. Chidambaram–MinÑč–Nguyen–TΓ’n study its cyclotomic factors, remaining factors, and Galois groups. This family has coefficients 0 and 1 and is not covered by the prime quadratic-character conjecture above.

References 1

Principal characters at semiprime moduli

For odd primes p>qp>q, put n=pqn=pq and

Sn={d>1:d∣pβˆ’1,Β dβ‰ q}βˆͺ{d>1:d∣qβˆ’1}βˆͺ{d>1:d∣gcd⁑(pq+1,p+q)}.S_n=\{d>1:d\mid p-1,\ d\ne q\}\cup\{d>1:d\mid q-1\}\cup\{d>1:d\mid\gcd(pq+1,p+q)\}.fn=Fnprinx∏d∈SnΞ¦d,fn(x)=xmgn(x+xβˆ’1),2m=deg⁑fn.f_n=\frac{F_n^{\mathrm{prin}}}{x\prod_{d\in S_n}\Phi_d},\qquad f_n(x)=x^m g_n(x+x^{-1}),\quad 2m=\deg f_n.

The indicated division is proved. Whether it removes every cyclotomic factor is part of the conjecture.

References 1
  • ChidambaramMinacNguyenTan2025 Β· Proposition 3.1, Theorem 3.2, and Definitions 3.3, 3.6 (published version)Proposition 3.1 proves the indicated divisibility; Theorem 3.2 makes completeness conditional on Conjecture 2.11.Source

Generalized quadratic characters

For a nontrivial fundamental discriminant Ξ”\Delta, write D=βˆ£Ξ”βˆ£D=|\Delta| and

FΞ”(x)=βˆ‘a=1Dβˆ’1(Ξ”a)xa.F_\Delta(x)=\sum_{a=1}^{D-1}\left(\frac{\Delta}{a}\right)x^a.

The symbol is the Kronecker symbol. Let rΞ”(d)r_\Delta(d) be the multiplicity of Ξ¦d\Phi_d in FΞ”/xF_\Delta/x. The monic non-cyclotomic remainder is

RΞ”=Β±FΞ”x∏dβ‰₯1Ξ¦drΞ”(d).R_\Delta=\pm\frac{F_\Delta}{x\prod_{d\ge1}\Phi_d^{r_\Delta(d)}}.

It may be constant for small conductors; irreducibility is asked only when its degree is positive.

The character identity χΔ(Dβˆ’a)=χΔ(βˆ’1)χΔ(a)\chi_\Delta(D-a)=\chi_\Delta(-1)\chi_\Delta(a) pairs the nonzero roots by inversion. After all cyclotomic factors are removed, no fixed root Β±1\pm1 remains. Thus a nonconstant RΞ”R_\Delta is reciprocal of even degree.

References 1
  • MinacNguyenTan2024 Β· Definitions 3.1–3.2, Question 3.9, and Conjecture 10.6 in arXiv:2206.11778v2The nonconstant restriction excludes the elementary cases with only cyclotomic factors.Source

Comparison of the three families

All three families are defined over Q\mathbb Q, but their quotients remove different factors.

Family and parameterPolynomial and removed factorsDegree and pair polynomialScope of the removal
Quadratic character, prime pβ‰₯7p\ge7Fp=βˆ‘a=1pβˆ’1(a/p)xaF_p=\sum_{a=1}^{p-1}(a/p)x^a; divide by x(1βˆ’x)x(1-x) if p≑3(mod4)p\equiv3\pmod4, and by x(1βˆ’x)2(x+1)x(1-x)^2(x+1) if p≑1(mod4)p\equiv1\pmod4.fp=xmgp(x+xβˆ’1)f_p=x^m g_p(x+x^{-1}); m=(pβˆ’3)/2m=(p-3)/2 or (pβˆ’5)/2(p-5)/2, respectively.The multiplicities of the displayed factors are exact. Irreducibility of this quotient is the conjecture; it is not defined by removing all cyclotomic factors.
Principal character, n=pqn=pq, odd primes p>qp>qFnprin=βˆ‘(a,n)=1, 1≀a≀nxaF_n^{\mathrm{prin}}=\sum_{(a,n)=1,\,1\le a\le n}x^a; divide by x∏d∈SnΞ¦dx\prod_{d\in S_n}\Phi_d, with SnS_n defined above.2m=nβˆ’2βˆ’βˆ‘d∈SnΟ†(d)2m=n-2-\sum_{d\in S_n}\varphi(d); fn=xmgn(x+xβˆ’1)f_n=x^m g_n(x+x^{-1}).Divisibility is proved. Completeness of the listed cyclotomic factors remains conditional on the source conjecture.
Quadratic character, nontrivial fundamental discriminant Ξ”\DeltaFΞ”=βˆ‘a=1βˆ£Ξ”βˆ£βˆ’1(Ξ”/a)xaF_\Delta=\sum_{a=1}^{|\Delta|-1}(\Delta/a)x^a; divide by xx and every actual cyclotomic factor, with full multiplicity.2m=βˆ£Ξ”βˆ£βˆ’2βˆ’βˆ‘drΞ”(d)Ο†(d)2m=|\Delta|-2-\sum_d r_\Delta(d)\varphi(d); when nonconstant, RΞ”=xmqΞ”(x+xβˆ’1)R_\Delta=x^m q_\Delta(x+x^{-1}).The removal is complete by definition. Determining its factors and multiplicities is a separate problem.

For a separable quotient of degree 2m2m, reciprocity gives an ambient group C2≀SmC_2\wr S_m; extra symmetries can force a smaller group. Three questions remain distinct: is the pair polynomial irreducible, is its reciprocal lift irreducible, and are the quadratic square classes independent over the pair splitting field? For the prime quadratic family, Corollary 4.2 proves the first two equivalent using special values. It does not settle the third. See the lift criterion and the quadratic kernel.

References 3

Necklace functions

Necklace polynomials are

Mn(x)=1nβˆ‘d∣nΞΌ(d)xn/d.M_n(x)=\frac1n\sum_{d\mid n}\mu(d)x^{n/d}.

The value Mn(q)M_n(q) counts monic irreducible polynomials of degree nn over Fq\mathbb F_q; this does not say that Mn(x)M_n(x) itself is irreducible. Hyde studies its cyclotomic factors.

For f∈Q(x)f\in\mathbb Q(x), a 2026 preprint studies Mn(f)=βˆ‘d∣nΞΌ(d)f(xd)\mathcal M_n(f)=\sum_{d\mid n}\mu(d)f(x^d). For squarefree n>1n>1, the principal-character Fekete polynomial satisfies

Fn(x)1βˆ’xn=Mn ⁣(x1βˆ’x).\frac{F_n(x)}{1-x^n}=\mathcal M_n\!\left(\frac{x}{1-x}\right).

For m>1m>1, let ΞΆm\zeta_m be a primitive mm-th root of unity. If ff has no pole at any ΞΆmd\zeta_m^d with d∣nd\mid n, and βˆ‘d∣n,Β d≑r(modm)ΞΌ(d)=0\sum_{d\mid n,\ d\equiv r\pmod m}\mu(d)=0 for every residue class rr, then Mn(f)(ΞΆm)=0\mathcal M_n(f)(\zeta_m)=0: group the terms by residue class. Since these are rational functions, divisibility means divisibility of the numerator after cancellation. The results do not prove irreducibility of the remaining Fekete factor.

References 2

Connections and evidence

Published

Which new primes create a prescribed Fekete factor?

For a fixed squarefree modulus and cyclotomic order, adjoining one prime is governed exactly by the stabilizer of one cyclotomic-field value.

Scope. Let N>1N>1 be squarefree, dβ‰₯2d\ge2 with d∀Nd\nmid N, and let pp be a prime not dividing NdNd. This concerns the principal-character Fekete polynomial.

Which new primes create a prescribed Fekete factor?For a fixed squarefree modulus and cyclotomic order, adjoining one prime is governed exactly by the stabilizer of one cyclotomic-field value. Connection 1: Principal-character Fekete F_N is an input to R_N = F_N / (1 βˆ’ Xα΄Ί). Divide by 1βˆ’Xα΄Ί and use Proposition 2.17 to express Rβ‚™ as a sum over divisors of N. Connection 2: R_N = F_N / (1 βˆ’ Xα΄Ί) is an input to Ξ± = R_N(ΞΆ_d). The assumption d∀N makes evaluation regular; the recent preprint gives explicit small-field evaluations and a broader sufficient framework. Connection 3: Ξ± = R_N(ΞΆ_d) is an input to K = β„š(Ξ±) inside β„š(ΞΆ_d). The value Ξ± defines the intermediate field K=β„š(Ξ±). Connection 4: R_N = F_N / (1 βˆ’ Xα΄Ί) leads to R_Np(ΞΆ_d) = Ξ± βˆ’ Οƒβ‚š(Ξ±). The published recurrence Rβ‚™β‚š(X)=Rβ‚™(X)βˆ’Rβ‚™(Xα΅–), together with Οƒβ‚š(ΞΆ_d)=ΞΆ_dα΅–, gives the displayed equality. Connection 5: R_Np(ΞΆ_d) = Ξ± βˆ’ Οƒβ‚š(Ξ±) is an input to R_Np(ΞΆ_d) = 0. The equality reduces the desired vanishing test to comparing Ξ± with its conjugate. Connection 6: R_Np(ΞΆ_d) = 0 is equivalent to Οƒβ‚š fixes Ξ±. The value Rβ‚™β‚š(ΞΆ_d) vanishes exactly when Οƒβ‚š(Ξ±)=Ξ±. Connection 7: Οƒβ‚š fixes Ξ± is equivalent to Οƒβ‚š belongs to Gal(β„š(ΞΆ_d)/K). An automorphism fixing β„š fixes Ξ± exactly when it fixes every element of β„š(Ξ±). Connection 8: K = β„š(Ξ±) inside β„š(ΞΆ_d) is an input to Οƒβ‚š belongs to Gal(β„š(ΞΆ_d)/K). The intermediate field determines the subgroup against which the residue class of p is tested. Connection 9: R_Np(ΞΆ_d) = 0 is equivalent to Ξ¦_d divides F_Np. Since d∀Np, the denominator 1βˆ’ΞΆ_dα΄Ία΅– is nonzero; vanishing is equivalent to Ξ¦_d dividing Fβ‚™β‚š over β„š.Principal-character Fekete F_N β€” related articlePrincipal-characterFekete F_NR_N = F_N / (1 βˆ’ Xα΄Ί) β€” related articleR_N = F_N / (1 βˆ’ Xα΄Ί)Ξ± = R_N(ΞΆ_d) β€” related articleΞ± = R_N(ΞΆ_d)K = β„š(Ξ±) inside β„š(ΞΆ_d) β€” related articleK = β„š(Ξ±) inside β„š(ΞΆ_d)R_Np(ΞΆ_d) = Ξ± βˆ’ Οƒβ‚š(Ξ±) β€” related articleR_Np(ΞΆ_d) = Ξ± βˆ’ Οƒβ‚š(Ξ±)R_Np(ΞΆ_d) = 0 β€” related articleR_Np(ΞΆ_d) = 0Οƒβ‚š fixes Ξ± β€” related articleΟƒβ‚š fixes Ξ±Οƒβ‚š belongs to Gal(β„š(ΞΆ_d)/K) β€” related articleΟƒβ‚š belongs toGal(β„š(ΞΆ_d)/K)Ξ¦_d divides F_Np β€” related articleΞ¦_d divides F_NpConnection 1: Divide by 1βˆ’Xα΄Ί and use Proposition 2.17 to express Rβ‚™ as a sum over divisors of N.MΓΆbius divisor sum [1]Connection 2: The assumption d∀N makes evaluation regular; the recent preprint gives explicit small-field evaluations and a broader sufficient framework.Evaluate at ΞΆ_d [2]Connection 3: The value Ξ± defines the intermediate field K=β„š(Ξ±).Field generated by thevalue [3]Connection 4: The published recurrence Rβ‚™β‚š(X)=Rβ‚™(X)βˆ’Rβ‚™(Xα΅–), together with Οƒβ‚š(ΞΆ_d)=ΞΆ_dα΅–, gives the displayed equality.Prime-extensionrecurrence [4]Connection 5: The equality reduces the desired vanishing test to comparing Ξ± with its conjugate.Test vanishing [5]Connection 6: The value Rβ‚™β‚š(ΞΆ_d) vanishes exactly when Οƒβ‚š(Ξ±)=Ξ±.Difference equals zero[6]Connection 7: An automorphism fixing β„š fixes Ξ± exactly when it fixes every element of β„š(Ξ±).Fix a generator of K [7]Connection 8: The intermediate field determines the subgroup against which the residue class of p is tested.Compute the stabilizer[8]Connection 9: Since d∀Np, the denominator 1βˆ’ΞΆ_dα΄Ία΅– is nonzero; vanishing is equivalent to Ξ¦_d dividing Fβ‚™β‚š over β„š.Denominator is nonzero[9]
Linked nodes open articles; numbered connections open the evidence below.Open full-size diagram

deduction or information flow equivalence

This is an elementary corollary of the published recurrence, proved below. Define

FN(X)=βˆ‘1≀a≀N(a,N)=1Xa,RN(X)=FN(X)1βˆ’XN=βˆ‘k∣NΞΌ(k)Xk1βˆ’Xk.F_N(X)=\sum_{\substack{1\le a\le N\\(a,N)=1}}X^a,\qquad R_N(X)=\frac{F_N(X)}{1-X^N}=\sum_{k\mid N}\mu(k)\frac{X^k}{1-X^k}.

For a primitive dd-th root ΞΆd\zeta_d, put Ξ±=RN(ΞΆd)\alpha=R_N(\zeta_d), L=Q(ΞΆd)L=\mathbb Q(\zeta_d), and K=Q(Ξ±)K=\mathbb Q(\alpha). Let Οƒp∈Gal⁑(L/Q)\sigma_p\in\operatorname{Gal}(L/\mathbb Q) send ΞΆd\zeta_d to ΞΆdp\zeta_d^p. Then the complete one-prime-extension criterion is

Ξ¦d∣FNpβŸΊΟƒp(Ξ±)=Ξ±βŸΊΟƒp∈Gal⁑(L/K).\boxed{\Phi_d\mid F_{Np}\quad\Longleftrightarrow\quad\sigma_p(\alpha)=\alpha\quad\Longleftrightarrow\quad\sigma_p\in\operatorname{Gal}(L/K).}

Proof. The published recurrence gives RNp(X)=RN(X)βˆ’RN(Xp)R_{Np}(X)=R_N(X)-R_N(X^p). Rational coefficients imply RN(ΞΆdp)=Οƒp(Ξ±)R_N(\zeta_d^p)=\sigma_p(\alpha). Since d∀Nd\nmid N and p∀dp\nmid d, both denominators 1βˆ’ΞΆdN1-\zeta_d^N and 1βˆ’ΞΆdNp1-\zeta_d^{Np} are nonzero. Evaluating the recurrence proves the first equivalence; fixing a field generator proves the second.

For N=21,d=24N=21,d=24, exact arithmetic gives R21(΢24)=΢246=iR_{21}(\zeta_{24})=\zeta_{24}^6=i. Thus K=Q(i)K=\mathbb Q(i) has degree two, whereas [L:Q]=8[L:\mathbb Q]=8, and for every prime p∀42p\nmid42,

Ξ¦24∣F21p⟺p≑1(mod4).\Phi_{24}\mid F_{21p}\quad\Longleftrightarrow\quad p\equiv1\pmod4.

The 2026 preprint presents this small-field mechanism in a broader framework. Here the recurrence, field argument, and example are checked directly. The criterion decides this extension problem exactly; it does not classify every cyclotomic factor for arbitrary moduli or prove irreducibility of the noncyclotomic remainder.

Inspect all 9 connections and exact references
Evidence for each connection
ConnectionStatement and source
1Principal-character Fekete F_N β†’ R_N = F_N / (1 βˆ’ Xα΄Ί)Construction / input

Divide by 1βˆ’Xα΄Ί and use Proposition 2.17 to express Rβ‚™ as a sum over divisors of N.

2R_N = F_N / (1 βˆ’ Xα΄Ί) β†’ Ξ± = R_N(ΞΆ_d)Construction / input

The assumption d∀N makes evaluation regular; the recent preprint gives explicit small-field evaluations and a broader sufficient framework.

  • R1 Β· Chidambaram et al. (2025)Propositions 2.14 and 2.17, pp. 57–58Published recurrence and MΓΆbius formula. The exact fixed-field equivalence is the elementary consequence proved below.Primary source
  • R3 Β· Nguyen Cao Minh et al. (2026)Proposition 4.1 and proof, pp. 17–18; Theorem 4.5, pp. 20–21; arXiv:2606.02324v12026 preprint: the explicit small-field example and a broader sufficient criterion. The general theorem is not needed for the proved equivalence on this page.Primary source
3Ξ± = R_N(ΞΆ_d) β†’ K = β„š(Ξ±) inside β„š(ΞΆ_d)Construction / input

The value Ξ± defines the intermediate field K=β„š(Ξ±).

  • R2 Β· ConradΒ§1, equation (1.1), p. 1; Theorem 2.4, p. 3Automorphisms fixing an intermediate field and compatibility with rational-coefficient evaluation.Primary source
4R_N = F_N / (1 βˆ’ Xα΄Ί) β†’ R_Np(ΞΆ_d) = Ξ± βˆ’ Οƒβ‚š(Ξ±)Deduction

The published recurrence Rβ‚™β‚š(X)=Rβ‚™(X)βˆ’Rβ‚™(Xα΅–), together with Οƒβ‚š(ΞΆ_d)=ΞΆ_dα΅–, gives the displayed equality.

5R_Np(ΞΆ_d) = Ξ± βˆ’ Οƒβ‚š(Ξ±) β†’ R_Np(ΞΆ_d) = 0Construction / input

The equality reduces the desired vanishing test to comparing Ξ± with its conjugate.

6R_Np(ΞΆ_d) = 0 ↔ Οƒβ‚š fixes Ξ±Equivalence

The value Rβ‚™β‚š(ΞΆ_d) vanishes exactly when Οƒβ‚š(Ξ±)=Ξ±.

7Οƒβ‚š fixes Ξ± ↔ Οƒβ‚š belongs to Gal(β„š(ΞΆ_d)/K)Equivalence

An automorphism fixing β„š fixes Ξ± exactly when it fixes every element of β„š(Ξ±).

  • R2 Β· ConradΒ§1, equation (1.1), p. 1; Theorem 2.4, p. 3Automorphisms fixing an intermediate field and compatibility with rational-coefficient evaluation.Primary source
8K = β„š(Ξ±) inside β„š(ΞΆ_d) β†’ Οƒβ‚š belongs to Gal(β„š(ΞΆ_d)/K)Construction / input

The intermediate field determines the subgroup against which the residue class of p is tested.

9R_Np(ΞΆ_d) = 0 ↔ Ξ¦_d divides F_NpEquivalence

Since d∀Np, the denominator 1βˆ’ΞΆ_dα΄Ία΅– is nonzero; vanishing is equivalent to Ξ¦_d dividing Fβ‚™β‚š over β„š.

Sources and scope checked .

Questions

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
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
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
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
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
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
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
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
Discuss this question β†’

Related topics

References

  1. Fekete polynomials, quadratic residues, and arithmetic

    MinÑč, JΓ‘n and Nguyen, Tung T. and TΓ’n, Nguyen Duy. Journal of Number Theory, 242, 532–575, 2023.

    Read the source
  2. Galois Theory

    Cox, David A. Edition 2. John Wiley & Sons, 2012.

    Read the source
  3. On the arithmetic of generalized Fekete polynomials

    MinÑč, JΓ‘n and Nguyen, Tung T. and TΓ’n, Nguyen Duy. Experimental Mathematics, 33(4), 723–754, 2024.

    Read the source
  4. Fekete polynomials of principal Dirichlet characters

    Chidambaram, Shiva and MinÑč, JΓ‘n and Nguyen, Tung T. and TΓ’n, Nguyen Duy. Journal of Experimental Mathematics, 1(1), 51–93, 2025.

    Read the source
  5. Cyclotomic factors of necklace polynomials

    Hyde, Trevor. Acta Arithmetica, 204(4), 287–316, 2022.

    Read the source
  6. Cyclotomic factors of rational necklace functions

    Nguyen Cao Minh and Nguyen Vu Hoang Minh and Dung Nguyen and Tung T. Nguyen and Nguyen Duy Tan and Duong Tran. arXiv:2606.02324v1, 2026.

    Read the source
  7. A random polynomial with multiplicative coefficients is almost surely irreducible

    VarjΓΊ, PΓ©ter P. and Xu, Max Wenqiang. International Mathematics Research Notices, 2026(16), rnag178, 2026.

    Read the source
  8. The Galois correspondence

    Conrad, Keith. Author-hosted expository notes.

    Read the source