Overview
- How does centering produce a polynomial in ?
- Which specializations are known to be irreducible?
- Does every irreducible reduced polynomial have group ?
Definition
For and , put
These are the binary Krawtchouk polynomials, with the length parameter allowed to be rational. The leading coefficient is , so the degree never drops.
References 1
- Cullinan2024 Β· Β§1.1, equation (1.1.1); arXiv:2212.07539v1Source
Centering and root pairs
Write , where . There is a degree- polynomial such that
Cullinanβs conjecture concerns the degree- polynomial . If is squarefree and has no zero root, the roots of form distinct opposite pairs. Its Galois group maps onto the group of , 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 , with , and let be an integer with . Then is irreducible over .
Proof
Write . For ,
where is the sum of the binary digits of . Since is an integer, every nonconstant coefficient belongs to . The leading coefficient has valuation . The constant coefficient is , which is odd by Lucasβs theorem because and is a power of two. Thus the reciprocal polynomial is Eisenstein at . It is irreducible over , and hence so is over .
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
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
Related topics
Reciprocal polynomials
Centering produces opposite root pairs and a quadratic kernel.
UsesNewton polygons and Galois groups
A 2-adic polygon proves selected irreducible specializations.
Linked from 1 articles
References
- On the irreducibility of the Krawtchouck polynomials
Cullinan, John. Journal of the Ramanujan Mathematical Society, 39(4), 323β335, 2024.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.