Indexed metadata

Irreducibility of Generalised Laguerre Polynomials for Large Integer Parameters

Drishya T. Das, Saheli Dutta, Shanta Laishram, Saranya G. Nair

Source record

Source: arXiv

Published: Oct 7, 2026

arXiv: 2610.10614

Open original source ↗

Source abstract

For a positive integer nn, we study the irreducibility of the generalised Laguerre polynomials Ln(a)(x)=1n!∑j=0n(nj)(n+a)!(j+a)!(−1)jxj, L_n^{(a)}(x) = \frac{1}{n!}\sum_{j=0}^{n} \binom{n}{j} \frac{(n+a)!}{(j+a)!}(-1)^j x^j, where a∈Z≥0a \in \mathbb{Z}_{\ge 0}. Earlier works established that these polynomials are irreducible over Q\mathbb{Q} for 0≤a≤500 \le a \le 50. In this paper, we substantially strengthen these results by establishing that Ln(a)(x)L_n^{(a)}(x) are irreducible for all a≤1000a \le 1000. We derive sharper constraints on potential integer roots and make systematic use of the geometry of the associated Newton polygons. This approach allows us to extend the irreducibility range significantly while keeping explicit computations to a minimum.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Irreducibility of Generalised Laguerre Polynomials for Large Integer Parameters — Mathematical Frontier Network