Overview
- For which pairs is known to be irreducible?
- For fixed , is its group eventually ?
- Is the sextic group for every ?
Definition
For integers , put
The conjectured irreducible range is . The boundary is different: is irreducible exactly when is prime.
References 1
Known results
For each fixed , irreducibility holds for all sufficiently large . For each , Filaseta–Kumchev–Pasechnik bound the number of reducible pairs with and by as .
Laishram–Yadav prove irreducibility in the range , within . Their explicit eventual bounds for irreducibility and the full symmetric group assume an explicit form of the conjecture. These conditional bounds do not settle every pair.
References 2
- FilasetaKumchevPasechnik2007 · Theorems 1 and 3; remark following Theorem 3Source
- LaishramYadav2024Truncated · Abstract; published article pp. 1663–1680Source
Galois groups
For every fixed , the group is for all sufficiently large . Filaseta–Moy prove this for . The sextic case was obtained by Rouse and Juillerat, as credited by Klahn–Technau, who give a separate proof using a resolvent and Faltings’ theorem.
For , the only possible sextic groups are and the transitive degree-six group . The latter occurs at . Filaseta–Moy conjecture that the group is for every . The finiteness theorem does not determine every exception.
References 3
- FilasetaMoy2018 · Theorem 1; §1, preprint pp. 2–3Source
- KlahnTechnau2023Truncated · Theorem 2; conjecture and attribution remark in §1, p. 2Source
- Juillerat2021Thesis · Abstract; Theorem 1.3 as cited by Klahn–TechnauSource
Example
Example
For ,
Thus is irreducible over for every , since its discriminant is negative. Its Galois group is .
Questions
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
Related topics
Taylor polynomials
Both questions concern arithmetic properties of truncations.
UsesNewton polygons and Galois groups
Valuations restrict factor degrees and give cycle information.
Linked from 1 articles
References
- On the irreducibility of a truncated binomial expansion
Filaseta, Michael and Kumchev, Angel and Pasechnik, Dmitrii. Rocky Mountain Journal of Mathematics, 37(2), 455–464, 2007.
Read the source - Irreducibility and Galois groups of truncated binomial polynomials
Laishram, Shanta and Yadav, Prabhakar. International Journal of Number Theory, 20(6), 1663–1680, 2024.
Read the source - On the Galois group over Q of a truncated binomial expansion
Filaseta, Michael and Moy, Richard. Colloquium Mathematicum, 154(2), 295–308, 2018.
Read the source - Galois groups of binom(n,0) + binom(n,1)X + ⋯ + binom(n,6)X⁶
Klahn, Benjamin and Technau, Marc. International Journal of Number Theory, 19(10), 2443–2450, 2023.
Read the source - Widely Digitally Stable Numbers and Irreducibility Criteria for Polynomials With Prime Values
Juillerat, Jacob. University of South Carolina, doctoral dissertation, 2021.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.