Overview

  • How does centering produce a polynomial in x2x^2?
  • Which specializations are known to be irreducible?
  • Does every irreducible reduced polynomial have group SmS_m?

Definition

For nβ‰₯1n\ge1 and t∈Qt\in\mathbb Q, put

Kn(t)(x)=βˆ‘j=0n(βˆ’2)j(tβˆ’jnβˆ’j)(xj).\mathcal K_n^{(t)}(x)=\sum_{j=0}^n(-2)^j\binom{t-j}{n-j}\binom{x}{j}.

These are the binary Krawtchouk polynomials, with the length parameter allowed to be rational. The leading coefficient is (βˆ’2)n/n!(-2)^n/n!, so the degree never drops.

References 1

Centering and root pairs

Write n=2m+δn=2m+\delta, where δ∈{0,1}\delta\in\{0,1\}. There is a degree-mm polynomial Qm(δ,t)Q_m^{(\delta,t)} such that

Kn(t)(x+t/2)=xΞ΄Qm(Ξ΄,t)(x2).\mathcal K_n^{(t)}(x+t/2)=x^\delta Q_m^{(\delta,t)}(x^2).

Cullinan’s conjecture concerns the degree-mm polynomial Qm(Ξ΄,t)Q_m^{(\delta,t)}. If Qm(Ξ΄,t)Q_m^{(\delta,t)} is squarefree and has no zero root, the roots of Qm(Ξ΄,t)(x2)Q_m^{(\delta,t)}(x^2) form mm distinct opposite pairs. Its Galois group maps onto the group of Qm(Ξ΄,t)Q_m^{(\delta,t)}, with an elementary abelian 2-group as kernel. The pair group does not determine this kernel. At degenerate specializations, use the distinct nonzero roots when forming pairs.

References 1
  • Cullinan2024 Β· Β§1.2, equations (1.2.4)–(1.2.5) and Lemma 2.0.1; arXiv:2212.07539v1Source

Known cases

Theorem Β· Cullinan

Let n=2an=2^a, with aβ‰₯0a\ge0, and let tt be an integer with n≀t<2nn\le t<2n. Then Kn(t)\mathcal K_n^{(t)} is irreducible over Q\mathbb Q.

Proof

Write (x)j=x(xβˆ’1)β‹―(xβˆ’j+1)(x)_j=x(x-1)\cdots(x-j+1). For j>0j>0,

(βˆ’2)j(xj)=(βˆ’2)jj!(x)j,v2(2j/j!)=s2(j)β‰₯1,(-2)^j\binom{x}{j}=\frac{(-2)^j}{j!}(x)_j,\qquad v_2(2^j/j!)=s_2(j)\ge1,

where s2(j)s_2(j) is the sum of the binary digits of jj. Since (tβˆ’jnβˆ’j)\binom{t-j}{n-j} is an integer, every nonconstant coefficient belongs to 2Z22\mathbb Z_2. The leading coefficient has valuation s2(n)=1s_2(n)=1. The constant coefficient is (tn)\binom tn, which is odd by Lucas’s theorem because n≀t<2nn\le t<2n and nn is a power of two. Thus the reciprocal polynomial xnKn(t)(xβˆ’1)x^n\mathcal K_n^{(t)}(x^{-1}) is Eisenstein at 22. It is irreducible over Q2\mathbb Q_2, and hence so is Kn(t)\mathcal K_n^{(t)} over Q\mathbb Q.

References 1
  • Cullinan2024 Β· Corollary 1.2.3 and its proof in Β§3, arXiv:2212.07539v1The displayed argument applies Eisenstein to the reciprocal in the normalization used here.Source

Questions

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

Related topics

References

  1. On the irreducibility of the Krawtchouck polynomials

    Cullinan, John. Journal of the Ramanujan Mathematical Society, 39(4), 323–335, 2024.

    Read the source