Overview

  • For fixed rational α\alpha, what is known about Ln(α)L_n^{(\alpha)} as nn grows?
  • For fixed nn, how many parameters give a group smaller than SnS_n?
  • Which parameters force a zero root or a square discriminant?

Definition and normalization

For n≥1n\ge1 and α∈Q\alpha\in\mathbb Q, set

Ln(α)(x)=∑j=0n(n+αn−j)(−x)jj!.L_n^{(\alpha)}(x)=\sum_{j=0}^n\binom{n+\alpha}{n-j}\frac{(-x)^j}{j!}.

The generalized binomial coefficient is a polynomial in α\alpha. For real α>−1\alpha>-1, these polynomials form a classical orthogonal family; the arithmetic question also makes sense outside that range. Their monic normalization is Mn(α)=(−1)nn!Ln(α)M_n^{(\alpha)}=(-1)^n n!L_n^{(\alpha)}.

If α=a/b\alpha=a/b in lowest terms, b>0b>0, then an integral monic normalization with the same splitting field is

bnn!Ln(a/b)(−x/b)=∑j=0n(nj)(∏k=j+1n(bk+a))xj.b^n n!L_n^{(a/b)}(-x/b)=\sum_{j=0}^n\binom nj\Bigl(\prod_{k=j+1}^n(bk+a)\Bigr)x^j.

The product permits valuation estimates using an arithmetic progression.

References 1
  • Hajir2005 · §§1 and 3Definition and the integral coefficient-product normalization.Source

Fixed parameter

Theorem (Filaseta–Lam; Hajir)

Fix α∈Q∖Z<0\alpha\in\mathbb Q\setminus\mathbb Z_{<0}. For every sufficiently large nn, depending on α\alpha, the polynomial Ln(α)L_n^{(\alpha)} is irreducible over Q\mathbb Q and its group contains AnA_n. It equals AnA_n or SnS_n according to whether its discriminant is a rational square.

Filaseta–Lam supply eventual irreducibility. Hajir obtains a large prime divisor of a Newton-slope denominator, then uses a permutation-group criterion. Irreducibility supplies the transitivity required by that criterion.

References 2
  • FilasetaLam2002Eventual irreducibility for a fixed rational parameter outside the negative integers.Source
  • Hajir2005 · Theorems 1.1 and 2.2Eventual alternating containment and the Newton-index criterion.Source

Connections and evidence

Claimed · preprint

Positive Laguerre parameters: a proposed complete classification

A recent preprint claims every irreducible and reducible case for 0≤a≤10000\le a\le1000. The exact exceptions are checkable; a proof-audit concern in the finite-pruning argument is recorded below.

Scope. Over Q\mathbb Q, for every integer n≥1n\ge1 and integer 0≤a≤10000\le a\le1000. The conclusion is an irreducibility classification, not a Galois-group classification.

Positive Laguerre parameters: a proposed complete classificationA recent preprint claims every irreducible and reducible case for \(0\le a\le1000\). The exact exceptions are checkable; a proof-audit concern in the finite-pruning argument is recorded below. Connection 1: Lₙ⁽ᵃ⁾ with 0 ≤ a ≤ 1000 is an input to Prime products; Newton polygons. The proof combines earlier small-parameter results with prime-product bounds and several edges of the Newton polygon for the enlarged range. Preprint claim. Connection 2: Prime products; Newton polygons leads to Exclude factor degrees 2 ≤ k ≤ n/2. The preprint claims exclusion of every proper factor degree between two and half the degree; this arrow records its proposed argument. Preprint claim. Connection 3: Lₙ⁽ᵃ⁾ with 0 ≤ a ≤ 1000 is an input to Integral-root constraints. The monic integral normalization makes every rational root integral, and the paper imposes sharper constraints on such a root. Preprint claim. Connection 4: Integral-root constraints leads to Classify linear-factor cases. The preprint claims precisely the listed linear-factor cases. The statement/proof mismatch in Lemma 6.1(iii), used for finite pruning, remains a proof-audit boundary. Preprint claim. Connection 5: Exclude factor degrees 2 ≤ k ≤ n/2 is an input to AND. The higher-degree exclusion must be combined with the linear-factor analysis. Connection 6: Classify linear-factor cases is an input to AND. Knowing the linear-factor cases alone would not exclude a higher-degree factorization. Connection 7: AND is an input to OR. If both exclusion arguments are complete, they exhaust all possible proper rational factors; the finite-pruning concern is stated below. Preprint claim. Connection 8: OR leads to Listed quadratic and quartic cases. The displayed quadratic identity and the quartic factorizations verify reducibility of every listed pair directly; this direction does not depend on completeness of the preprint proof. Connection 9: OR leads to Every other member is irreducible. Theorem 1.1 claims irreducibility outside the exception list; this conclusion retains the proof-audit limitation noted below. Preprint claim.Lₙ⁽ᵃ⁾ with 0 ≤ a ≤ 1000 — related articleLₙ⁽ᵃ⁾ with 0 ≤ a ≤ 1000Prime products; Newton polygons — related articlePrime products; NewtonpolygonsExclude factor degrees 2 ≤ k ≤ n/2 — related articleExclude factor degrees 2≤ k ≤ n/2Integral-root constraints — related articleIntegral-root constraintsClassify linear-factor cases — related articleClassify linear-factorcasesANDANDORORListed quadratic and quartic cases — related articleListed quadratic andquartic casesEvery other member is irreducible — related articleEvery other member isirreducibleConnection 1: The proof combines earlier small-parameter results with prime-product bounds and several edges of the Newton polygon for the enlarged range.Several polygon edges[1]Connection 2: The preprint claims exclusion of every proper factor degree between two and half the degree; this arrow records its proposed argument.Exclude higher factordegrees [2]Connection 3: The monic integral normalization makes every rational root integral, and the paper imposes sharper constraints on such a root.Divisibility and rootbounds [3]Connection 4: The preprint claims precisely the listed linear-factor cases. The statement/proof mismatch in Lemma 6.1(iii), used for finite pruning, remains a proof-audit boundary.Claimed linear-factorcases [4]Connection 5: The higher-degree exclusion must be combined with the linear-factor analysis.input [5]Connection 6: Knowing the linear-factor cases alone would not exclude a higher-degree factorization.input [6]Connection 7: If both exclusion arguments are complete, they exhaust all possible proper rational factors; the finite-pruning concern is stated below.Claimed classification[7]Connection 8: The displayed quadratic identity and the quartic factorizations verify reducibility of every listed pair directly; this direction does not depend on completeness of the preprint proof.Exceptional pair [8]Connection 9: Theorem 1.1 claims irreducibility outside the exception list; this conclusion retains the proof-audit limitation noted below.All other pairs [9]
Linked nodes open articles; numbered connections open the evidence below.Open full-size diagram

deduction or information flow preprint claimAND joint hypothesesOR alternatives

For the standard Laguerre polynomial Ln(a)L_n^{(a)}, with integers n≥1n\ge1 and 0≤a≤10000\le a\le1000, Theorem 1.1 of the October 2026 preprint states irreducibility over Q\mathbb Q except exactly when

n=2,a=m2−2(2≤m≤31),n=4,a∈{5,23}.\begin{aligned}n&=2,&a&=m^2-2\quad(2\le m\le31),\\n&=4,&a&\in\{5,23\}.\end{aligned}

Each exceptional member has a linear factor. The quadratic family is visible directly:

2L2(m2−2)(X)=(X−m2+m)(X−m2−m).2L_2^{(m^2-2)}(X)=\bigl(X-m^2+m\bigr)\bigl(X-m^2-m\bigr).

The proposed proof treats higher factor degrees and linear factors separately, using several Newton-polygon edges and integral-root constraints. This theorem does not determine the Galois groups.

The two quartic exceptions can also be checked directly:

24L4(5)(X)=(X−6)(X3−30X2+252X−504),24L4(23)(X)=(X−30)(X3−78X2+1872X−14040).\begin{aligned}24L_4^{(5)}(X)&=(X-6)(X^3-30X^2+252X-504),\\24L_4^{(23)}(X)&=(X-30)(X^3-78X^2+1872X-14040).\end{aligned}

Proof-audit boundary. In v1, Lemma 6.1(iii) states simultaneous valuation bounds where its proof gives alternatives, and additional proof branches are absent from the statement. Lemmas 6.5–6.6 use these restrictions to prune finite cases. Exhaustiveness under the weaker conditions has not been verified. This concerns the proof as written; it is not a counterexample to the classification.

Inspect all 9 connections and exact references
Evidence for each connection
ConnectionStatement and source
1Lₙ⁽ᵃ⁾ with 0 ≤ a ≤ 1000 → Prime products; Newton polygonsConstruction / input · preprint

The proof combines earlier small-parameter results with prime-product bounds and several edges of the Newton polygon for the enlarged range.

2Prime products; Newton polygons → Exclude factor degrees 2 ≤ k ≤ n/2Deduction · preprint

The preprint claims exclusion of every proper factor degree between two and half the degree; this arrow records its proposed argument.

3Lₙ⁽ᵃ⁾ with 0 ≤ a ≤ 1000 → Integral-root constraintsConstruction / input · preprint

The monic integral normalization makes every rational root integral, and the paper imposes sharper constraints on such a root.

  • R3 · Das et al. (2026)Proposition 1.3; Lemma 6.1(iii), pp. 13–14; Lemmas 6.5–6.6, p. 17, version 1The statement gives simultaneous bounds where its proof derives alternatives; later finite pruning uses this lemma. Exhaustiveness under the weaker conditions has not been verified.Primary source
4Integral-root constraints → Classify linear-factor casesDeduction · preprint

The preprint claims precisely the listed linear-factor cases. The statement/proof mismatch in Lemma 6.1(iii), used for finite pruning, remains a proof-audit boundary.

  • R1 · Das et al. (2026)Theorem 1.1, p. 2; arXiv:2610.10614v1, 7 October 2026The full theorem includes exceptions omitted from the abstract’s abbreviated description.Primary source
  • R3 · Das et al. (2026)Proposition 1.3; Lemma 6.1(iii), pp. 13–14; Lemmas 6.5–6.6, p. 17, version 1The statement gives simultaneous bounds where its proof derives alternatives; later finite pruning uses this lemma. Exhaustiveness under the weaker conditions has not been verified.Primary source
5Exclude factor degrees 2 ≤ k ≤ n/2 → ANDConstruction / input

The higher-degree exclusion must be combined with the linear-factor analysis.

6Classify linear-factor cases → ANDConstruction / input

Knowing the linear-factor cases alone would not exclude a higher-degree factorization.

7AND → ORConstruction / input · preprint

If both exclusion arguments are complete, they exhaust all possible proper rational factors; the finite-pruning concern is stated below.

8OR → Listed quadratic and quartic casesDeduction

The displayed quadratic identity and the quartic factorizations verify reducibility of every listed pair directly; this direction does not depend on completeness of the preprint proof.

9OR → Every other member is irreducibleDeduction · preprint

Theorem 1.1 claims irreducibility outside the exception list; this conclusion retains the proof-audit limitation noted below.

Sources and scope checked .

Small rational parameters

Theorem (Laishram–Shorey)

Let q∈{±13,±23,±14,±34}q\in\{\pm\tfrac13,\pm\tfrac23,\pm\tfrac14,\pm\tfrac34\}. For every n≥1n\ge1, Ln(q)(x)L_n^{(q)}(x) is irreducible over Q\mathbb Q, except when (q,n)=(14,2)(q,n)=(\tfrac14,2).

The proof combines Newton polygons with large prime divisors of arithmetic-progression products.

Example

L2(1/4)(x)=(4x−3)(4x−15)32.L_2^{(1/4)}(x)=\frac{(4x-3)(4x-15)}{32}.

The exception is explicit in arXiv:1306.0736v2. The power-substitution statement in the cited theorem requires a low-degree qualification: although L1(−3/4)(x)=1/4−xL_1^{(-3/4)}(x)=1/4-x is irreducible, L1(−3/4)(x4)=(1/2−x2)(1/2+x2)L_1^{(-3/4)}(x^4)=(1/2-x^2)(1/2+x^2).

References 1
  • LaishramShorey2016III · Theorem 1 and §8; arXiv:1306.0736v2The ordinary Laguerre assertion only is used; see the explicit boundary example for power substitutions.Source

Fixed degree

Fix a number field KK and a degree n≥10n\ge10. Then all but finitely many α∈K\alpha\in K give an irreducible polynomial Ln(α)L_n^{(\alpha)} with Galois group SnS_n over KK. Hajir–Wong prove this using intermediate covers and finiteness of rational points on curves of sufficiently high genus.

The exceptional set depends on the fixed degree and number field. Its finiteness is stronger than the conclusion of Hilbert irreducibility.

References 1
  • HajirWong2006 · Theorem 1(a)The finite exceptional set for fixed n≥10 and fixed number field K.Source

Discriminant

Schur's product formula for the monic normalization is

disc⁡(Mn(α))=∏j=2njj(α+j)j−1.\operatorname{disc}(M_n^{(\alpha)})=\prod_{j=2}^n j^j(\alpha+j)^{j-1}.

Example (α=0, n=3)

Here M3=x3−9x2+18x−6M_3=x^3-9x^2+18x-6. Eisenstein at 33 proves irreducibility. Its discriminant is 2335=19442^3 3^5=1944, a nonsquare. An irreducible cubic has group A3A_3 or S3S_3; therefore this group is S3S_3.

The product also determines the parameters with repeated roots: for degree n≥2n\ge2, the exceptional values are −2,−3,…,−n-2,-3,\ldots,-n. Separability and irreducibility are separate properties; at α=−1\alpha=-1 there is already a simple rational root at zero.

References 2

Negative integer parameters

Remark

For integers m≥1m\ge1 and n≥mn\ge m, coefficient comparison gives

Ln(−m)(x)=(−x)m(n−m)!n!Ln−m(m)(x).L_n^{(-m)}(x)=(-x)^m\frac{(n-m)!}{n!}L_{n-m}^{(m)}(x).

For example, L3(−2)(x)=x2(3−x)/6L_3^{(-2)}(x)=x^2(3-x)/6. Thus a fixed negative integer parameter supplies a forced zero for every sufficiently large degree. This explains the negative-integer exclusion in the fixed-parameter theorem.

The varying parameter α=−n−1\alpha=-n-1 gives Ln(−n−1)=(−1)nTnL_n^{(-n-1)}=(-1)^n T_n, the exponential truncation. Here the parameter depends on the degree, so the fixed-parameter obstruction does not apply.

References 1
  • Hajir2005 · §1, Remarks 1 and 3The negative-integer exclusion and the exponential specialization.Source

Alternating groups

For every n>2n>2 with n≡2(mod4)n\equiv2\pmod4, the polynomial Ln(n)L_n^{(n)} is irreducible and has group AnA_n. Together with Schur's other Laguerre specializations, this realizes every AnA_n in this family. At n=2n=2, L2(2)=(x−2)(x−6)/2L_2^{(2)}=(x-2)(x-6)/2 is split and its group is the trivial group A2A_2; irreducibility is not claimed there.

For integer parameters, Banerjee–Filaseta–Finch–Leidy classify nonzero square discriminants. Banerjee–Bera subsequently study the actual alternating Galois groups for integer α≠n\alpha\ne n, up to finitely many exceptions. The square-discriminant classification and the group classification answer different questions.

References 3

Questions

Research directionPolynomial families

Which explicit varying-parameter sequences have irreducible Laguerre polynomials?

Scope. Ln(αn)L_n^{(\alpha_n)} over Q, with the sequence α_n specified in advance.

Eventual irreducibility for each fixed parameter does not imply irreducibility when the parameter changes with the degree. A sequence of parameters requires uniform control of factor degrees or a separate argument using its coefficient products.

References 2
Discuss this question →
SettledPolynomial families

Are there only finitely many exceptional parameters in fixed degree n≥10n\ge10?

Scope. Any fixed number field KK and fixed n≥10n\ge10.

Yes: the parameters in KK for which the polynomial is reducible or has Galois group different from SnS_n form a finite set. The theorem does not automatically provide an effective list of those parameters.

References 1
Discuss this question →

Related topics

References

  1. On the Galois group of generalized Laguerre polynomials

    Hajir, Farshid. Journal de théorie des nombres de Bordeaux, 17(2), 517–525, 2005.

    Read the source
  2. On the irreducibility of the generalized Laguerre polynomials

    Filaseta, Michael and Lam, Tsit-Yuen. Acta Arithmetica, 105(2), 177–182, 2002.

    Read the source
  3. Irreducibility of generalized Hermite–Laguerre polynomials III

    Laishram, Shanta and Shorey, Tarlok N. Journal of Number Theory, 164, 303–322, 2016.

    Read the source
  4. Specializations of one-parameter families of polynomials

    Hajir, Farshid and Wong, Siman. Annales de l’Institut Fourier, 56(4), 1127–1163, 2006.

    Read the source
  5. Affektlose Gleichungen in der Theorie der Laguerreschen und Hermiteschen Polynome

    Schur, Issai. Journal für die reine und angewandte Mathematik, 165, 52–58, 1931.

    Read the source
  6. Laguerre polynomials with Galois group A_m for each m

    Filaseta, Michael and Kidd, Travis and Trifonov, Ognian. Journal of Number Theory, 132, 776–805, 2012.

    Read the source
  7. On classifying Laguerre polynomials which have Galois group the alternating group

    Banerjee, Pradipto and Filaseta, Michael and Finch, Carrie E. and Leidy, J. Russell. Journal de théorie des nombres de Bordeaux, 25(1), 1–30, 2013.

    Read the source
  8. Classifying families of orthogonal polynomials having Galois group the alternating group

    Banerjee, Pradipto and Bera, Ranjan. Journal of Number Theory, 240, 31–49, 2022.

    Read the source
  9. Algebraic properties of a family of generalized Laguerre polynomials

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

    Read the source
  10. Irreducibility of Generalised Laguerre Polynomials for Large Integer Parameters

    Das, Drishya T. and Dutta, Saheli and Laishram, Shanta and Nair, Saranya G. arXiv preprint, 2026.

    Read the source