Overview

  • Is Fn,rF_{n,r} irreducible for every n≥1n\ge1 and r≥0r\ge0?
  • If it is irreducible, must its group contain AnA_n?
  • Which coefficient modifications preserve irreducibility?

Definition

For integers n≥1n\ge1 and r≥0r\ge0, set

Fn,r(x)=∑j=0n(n−j+rn−j)xjj!=(−1)nLn(−n−r−1)(x).F_{n,r}(x)=\sum_{j=0}^n\binom{n-j+r}{n-j}\frac{x^j}{j!}=(-1)^nL_n^{(-n-r-1)}(x).

The parameter of the Laguerre polynomial varies with its degree. The case r=0r=0 is the exponential truncation. The diagonal r=nr=n is equivalent to the Bessel polynomial by reversal and rational scaling.

References 1

Known ranges

Hajir proves both conjectures for each fixed rr and sufficiently large nn, and in every degree for 0≤r≤80\le r\le8. Jindal–Nair–Shorey extend all-degree irreducibility to 0≤r≤920\le r\le92. For 93≤r≤10093\le r\le100, they exclude proper linear factors and obtain alternating-group containment conditional on irreducibility. Their result does not eliminate higher-degree factors in that last range.

References 2

Connections and evidence

Published

Negative Laguerre parameters: a complete Galois classification

Factor exclusion, local permutations, and the discriminant determine every group in the strip 61≤s≤9261\le s\le92.

Scope. Over Q\mathbb Q, for every integer n≥1n\ge1 and every integer 61≤s≤9261\le s\le92, with α=−n−s−1\alpha=-n-s-1.

Negative Laguerre parameters: a complete Galois classificationFactor exclusion, local permutations, and the discriminant determine every group in the strip \(61\le s\le92\). Connection 1: Negative Laguerre family is an input to Factor-degree and root tests. The recalled factor-degree theorem and the rational-root analysis exhaust possible proper factors in this parameter strip. Connection 2: Factor-degree and root tests leads to Irreducible in every degree. Eliminating the possible linear factor completes irreducibility; degrees one and two are included in the stated theorem. Connection 3: Negative Laguerre family is an input to Newton polygons; finite cases. The proof obtains alternating containment from Newton-index witnesses, with the remaining finite degrees handled separately. Connection 4: Irreducible in every degree is an input to AND. Transitivity is one input to the permutation-group argument. Connection 5: Newton polygons; finite cases is an input to AND. The local witnesses and finite checks are the other input; irreducibility alone does not determine the group. Connection 6: AND leads to G contains Aₙ. The joint inputs establish alternating containment for every degree in the selected parameter strip. Connection 7: Negative Laguerre family leads to Schur discriminant formula. Schur’s formula computes the discriminant of the monic normalization. Connection 8: G contains Aₙ is an input to AND. For n ≥ 2, alternating containment leaves Aₙ and Sₙ as the two possibilities; in degree one they coincide. Connection 9: Schur discriminant formula is an input to AND. For n ≥ 2, the discriminant square class distinguishes Aₙ from Sₙ; degree one is handled directly. Connection 10: AND is an input to OR. For n ≥ 2, the explicit square-discriminant calculation gives the exceptional pairs; n = 1 belongs to the trivial S₁ branch. Connection 11: OR leads to Aₙ: ten explicit pairs. For a pair in E, the group is exactly Aₙ. Connection 12: OR leads to Sₙ: every other pair. For every other pair in the stated strip, the group is exactly Sₙ.Negative Laguerre family — related articleNegative Laguerre familyFactor-degree and root tests — related articleFactor-degree and roottestsIrreducible in every degree — related articleIrreducible in everydegreeNewton polygons; finite cases — related articleNewton polygons; finitecasesANDANDG contains Aₙ — related articleG contains AₙSchur discriminant formula — related articleSchur discriminant formulaANDANDORORAₙ: ten explicit pairs — related articleAₙ: ten explicit pairsSₙ: every other pair — related articleSₙ: every other pairConnection 1: The recalled factor-degree theorem and the rational-root analysis exhaust possible proper factors in this parameter strip.Factor exclusions [1]Connection 2: Eliminating the possible linear factor completes irreducibility; degrees one and two are included in the stated theorem.Theorem 1.1 [2]Connection 3: The proof obtains alternating containment from Newton-index witnesses, with the remaining finite degrees handled separately.Local witnesses [3]Connection 4: Transitivity is one input to the permutation-group argument.input [4]Connection 5: The local witnesses and finite checks are the other input; irreducibility alone does not determine the group.input [5]Connection 6: The joint inputs establish alternating containment for every degree in the selected parameter strip.Alternating containment[6]Connection 7: Schur’s formula computes the discriminant of the monic normalization.Product formula [7]Connection 8: For n ≥ 2, alternating containment leaves Aₙ and Sₙ as the two possibilities; in degree one they coincide.input [8]Connection 9: For n ≥ 2, the discriminant square class distinguishes Aₙ from Sₙ; degree one is handled directly.input [9]Connection 10: For n ≥ 2, the explicit square-discriminant calculation gives the exceptional pairs; n = 1 belongs to the trivial S₁ branch.Discriminant split [10]Connection 11: For a pair in E, the group is exactly Aₙ.Pair in the displayed setE [11]Connection 12: For every other pair in the stated strip, the group is exactly Sₙ.Pair outside E [12]
Linked nodes open articles; numbered connections open the evidence below.Open full-size diagram

deduction or information flowAND joint hypothesesOR alternatives

Let Mn,s(X)=(−1)nn!Ln(−n−s−1)(X)M_{n,s}(X)=(-1)^n n!L_n^{(-n-s-1)}(X), with integers n≥1n\ge1 and 61≤s≤9261\le s\le92. Jindal–Nair–Shorey prove that every member is irreducible over Q\mathbb Q, and give the complete group classification

Gal⁡(Mn,s/Q)={An,(n,s)∈E,Sn,(n,s)∉E,\operatorname{Gal}(M_{n,s}/\mathbb Q)=\begin{cases}A_n,&(n,s)\in E,\\S_n,&(n,s)\notin E,\end{cases}

where

E={(60,61),(61,64),(64,65),(68,69),(72,73),(76,77),(80,81),(81,80),(84,85),(88,89)}.\begin{aligned}E=\{&(60,61),(61,64),(64,65),(68,69),(72,73),\\&(76,77),(80,81),(81,80),(84,85),(88,89)\}.\end{aligned}

The factor-degree restrictions leave only a possible linear factor; the root analysis excludes it. Newton-index arguments and finite checks then give alternating containment. For the monic normalization, Schur’s formula is

disc⁡(Mn,s)=∏j=2njj(−n−s−1+j)j−1.\operatorname{disc}(M_{n,s})=\prod_{j=2}^{n}j^j(-n-s-1+j)^{j-1}.

For n≥2n\ge2, its square class selects the two branches. Degree one is immediate, with A1=S1A_1=S_1. The adjacent range 93≤s≤10093\le s\le100 requires irreducibility separately; see known ranges.

Inspect all 12 connections and exact references
Evidence for each connection
ConnectionStatement and source
1Negative Laguerre family → Factor-degree and root testsConstruction / input

The recalled factor-degree theorem and the rational-root analysis exhaust possible proper factors in this parameter strip.

2Factor-degree and root tests → Irreducible in every degreeDeduction

Eliminating the possible linear factor completes irreducibility; degrees one and two are included in the stated theorem.

3Negative Laguerre family → Newton polygons; finite casesConstruction / input

The proof obtains alternating containment from Newton-index witnesses, with the remaining finite degrees handled separately.

4Irreducible in every degree → ANDConstruction / input

Transitivity is one input to the permutation-group argument.

5Newton polygons; finite cases → ANDConstruction / input

The local witnesses and finite checks are the other input; irreducibility alone does not determine the group.

6AND → G contains AₙDeduction

The joint inputs establish alternating containment for every degree in the selected parameter strip.

7Negative Laguerre family → Schur discriminant formulaDeduction

Schur’s formula computes the discriminant of the monic normalization.

8G contains Aₙ → ANDConstruction / input

For n ≥ 2, alternating containment leaves Aₙ and Sₙ as the two possibilities; in degree one they coincide.

9Schur discriminant formula → ANDConstruction / input

For n ≥ 2, the discriminant square class distinguishes Aₙ from Sₙ; degree one is handled directly.

10AND → ORConstruction / input

For n ≥ 2, the explicit square-discriminant calculation gives the exceptional pairs; n = 1 belongs to the trivial S₁ branch.

11OR → Aₙ: ten explicit pairsDeduction

For a pair in E, the group is exactly Aₙ.

12OR → Sₙ: every other pairDeduction

For every other pair in the stated strip, the group is exactly Sₙ.

Sources and scope checked .

An explicit degree bound

Jindal–Laishram–Sarma prove both conjectures for 0≤r≤600\le r\le60. They also give the sufficient bound

n>exp⁡ ⁣(r(1+1.2762log⁡r)),r≥2.n>\exp\!\left(r\left(1+\frac{1.2762}{\log r}\right)\right),\qquad r\ge2.

The cases r=0,1r=0,1 are already known in every degree. Their method combines restrictions on factor degrees with Newton polygons and estimates for primes. The bound is effective and grows exponentially with rr.

References 1
  • JindalLaishramSarma2018 · Theorems 1.1–1.2 and §6The logarithmic bound is written only for r≥2; its printed formula is undefined at r=0,1.Source

Padé approximants

The same family occurs in rational approximation to the exponential function. For positive integers u,vu,v,

Fu,v(x)Fv,u(−x)=ex+O(xu+v+1)(x→0).\frac{F_{u,v}(x)}{F_{v,u}(-x)}=e^x+O(x^{u+v+1})\qquad(x\to0).

Thus arithmetic questions about the numerator and denominator are Laguerre questions. Cullinan–Scheel use this identity to study their irreducibility and Galois groups. When u=v=mu=v=m, reversal identifies the polynomials with the Bessel family, so both have group SmS_m. Their near-diagonal group theorem assumes irreducibility; that hypothesis is explicit in the source.

References 3

Recent preprint

The November 2026 preprint uses Hn,s=n!Fn,s−1H_{n,s}=n!F_{n,s-1}, with s≥1s\ge1. It claims a degree threshold independent of ss, together with an effective finite exceptional set. The remaining finite exceptional set is not resolved by this claim alone. Its full argument has not been verified here.

References 1

Coefficient modifications

If Fn,r=∑ajxjF_{n,r}=\sum a_jx^j, an admissible modification is ∑bjajxj\sum b_ja_jx^j, with bj∈Zb_j\in\mathbb Z, b0=±1b_0=\pm1, and bn=1b_n=1. Irreducibility of every such modification is stronger and sometimes false: for (n,r)=(2,3)(n,r)=(2,3), changing the sign of the constant coefficient of 2F2,32F_{2,3} gives

x2+8x−20=(x−2)(x+10).x^2+8x-20=(x-2)(x+10).

Banerjee–Bera prove eventual irreducibility of all admissible modifications for each fixed r. Shorey–Sinha give further small-parameter factor restrictions and explicit exceptional-pair calculations.

References 4

Questions

OpenPolynomial families

Is Fn,rF_{n,r} irreducible for every n≥1n\ge1 and r≥0r\ge0?

Scope. Integers n≥1n\ge1 and r≥0r\ge0, over Q\mathbb Q.

Set

Fn,r(x)=∑j=0n(n−j+rn−j)xjj!=(−1)nLn(−n−r−1)(x).F_{n,r}(x)=\sum_{j=0}^n\binom{n-j+r}{n-j}\frac{x^j}{j!}=(-1)^nL_n^{(-n-r-1)}(x).

Hajir’s first conjecture asks whether this polynomial is irreducible for every such pair. The published ranges and the recent uniform preprint claim do not by themselves settle every pair.

References 3
Discuss this question →
OpenPolynomial families

If Fn,rF_{n,r} is irreducible, must its group contain AnA_n?

Scope. n≥1n\ge1, r≥0r\ge0, assuming irreducibility over Q\mathbb Q.

This is Hajir’s second conjecture. Equality with SnS_n is not asserted: the discriminant can be a square.

References 1
Discuss this question →
OpenPolynomial families

Which Laguerre polynomials remain irreducible under every admissible coefficient modification?

Scope. Integers n≥1n\ge1, r≥0r\ge0; all b0,…,bn∈Zb_0,\ldots,b_n\in\mathbb Z with b0=±1b_0=\pm1 and bn=1b_n=1; irreducibility over Q\mathbb Q.

Classify the pairs (n,r)(n,r) for which every polynomial

Gn,r,b(x)=∑j=0nbj(n−j+rn−j)xjj!G_{n,r,\mathbf b}(x)=\sum_{j=0}^n b_j\binom{n-j+r}{n-j}\frac{x^j}{j!}

with the stated endpoint conditions is irreducible. This is the admissible modification problem for Hajir’s family. The pair (2,3)(2,3) is excluded: taking b0=−1b_0=-1 and b1=b2=1b_1=b_2=1 gives 2G2,3,b(x)=x2+8x−20=(x−2)(x+10)2G_{2,3,\mathbf b}(x)=x^2+8x-20=(x-2)(x+10). Later work proves eventual results for each fixed rr and further explicit small-parameter results; the full classification remains open.

References 3
Discuss this question →

Related topics

References

  1. Algebraic properties of a family of generalized Laguerre polynomials

    Hajir, Farshid. Canadian Journal of Mathematics, 61(3), 583–603, 2009.

    Read the source
  2. Extension of irreducibility results on generalized Laguerre polynomials L_n^(-n-s-1)(x)

    Jindal, Ankita and Nair, Saranya G. and Shorey, Tarlok N. Publicationes Mathematicae Debrecen, 105(3-4), 473–494, 2024.

    Read the source
  3. Irreducibility and Galois groups of generalized Laguerre polynomials L_n^(-1-n-r)(x)

    Jindal, Ankita and Laishram, Shanta and Sarma, Ritumoni. Journal of Number Theory, 183, 388–406, 2018.

    Read the source
  4. On the arithmetic of Padé approximants to the exponential function

    Cullinan, John and Scheel, Nick. Journal of the Ramanujan Mathematical Society, 37(3), 207–219, 2022.

    Read the source
  5. The irreducibility of the Bessel polynomials

    Filaseta, Michael and Trifonov, Ognian. Journal für die reine und angewandte Mathematik, 550, 125–140, 2002.

    Read the source
  6. Bessel Polynomials

    Grosswald, Emil. Springer, Lecture Notes in Mathematics, vol. 698, 1978.

    Read the source
  7. Uniform irreducibility and Galois groups of generalized Laguerre polynomials

    Nguyen-Dang, Khai-Hoan. Hexagon preprint, 2026.

    Read the source
  8. An irreducibility question concerning modifications of Laguerre polynomials

    Banerjee, Pradipto and Bera, Ranjan. International Journal of Number Theory, 16(5), 1031–1051, 2020.

    Read the source
  9. Extension of Laguerre polynomials with negative arguments

    Shorey, Tarlok N. and Sinha, Sneh Bala. Indagationes Mathematicae, 33(4), 801–815, 2022.

    Read the source
  10. Extension of Laguerre polynomials with negative arguments II

    Shorey, Tarlok N. and Sinha, Sneh Bala. Indagationes Mathematicae, 33(4), 880–884, 2022.

    Read the source