Overview

  • For which pairs (n,r)(n,r) is Pn,rP_{n,r} known to be irreducible?
  • For fixed rr, is its group eventually SrS_r?
  • Is the sextic group S6S_6 for every n≥11n\ge11?

Definition

For integers n>r≥1n>r\ge1, put

Pn,r(x)=∑j=0r(nj)xj.P_{n,r}(x)=\sum_{j=0}^{r}\binom njx^j.

The conjectured irreducible range is 1≤r≤n−21\le r\le n-2. The boundary r=n−1r=n-1 is different: Pn,n−1=(1+x)n−xnP_{n,n-1}=(1+x)^n-x^n is irreducible exactly when nn is prime.

References 1

Known results

For each fixed rr, irreducibility holds for all sufficiently large nn. For each ε>0\varepsilon>0, Filaseta–Kumchev–Pasechnik bound the number of reducible pairs with 1≤r≤n−21\le r\le n-2 and n≤Nn\le N by Oε(N23/18+ε)O_\varepsilon(N^{23/18+\varepsilon}) as N→∞N\to\infty.

Laishram–Yadav prove irreducibility in the range 2r≤n<(r+1)102r\le n<(r+1)^{10}, within n>r+1n>r+1. Their explicit eventual bounds for irreducibility and the full symmetric group assume an explicit form of the abcabc conjecture. These conditional bounds do not settle every pair.

References 2

Galois groups

For every fixed r≥2r\ge2, the group is SrS_r for all sufficiently large nn. Filaseta–Moy prove this for r≠6r\ne6. 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 n≥8n\ge8, the only possible sextic groups are S6S_6 and the transitive degree-six group PGL⁡2(5)≅S5\operatorname{PGL}_2(5)\cong S_5. The latter occurs at n=10n=10. Filaseta–Moy conjecture that the group is S6S_6 for every n≥11n\ge11. The finiteness theorem does not determine every exception.

References 3

Example

Example

For r=2r=2,

disc⁡(Pn,2)=n2−4(n2)=n(2−n).\operatorname{disc}(P_{n,2})=n^2-4\binom n2=n(2-n).

Thus Pn,2P_{n,2} is irreducible over Q\mathbb Q for every n≥3n\ge3, since its discriminant is negative. Its Galois group is S2S_2.

Questions

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

Related topics

References

  1. 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
  2. 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
  3. 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
  4. 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
  5. Widely Digitally Stable Numbers and Irreducibility Criteria for Polynomials With Prime Values

    Juillerat, Jacob. University of South Carolina, doctoral dissertation, 2021.

    Read the source