Extension of Laguerre polynomials with negative arguments
T. N. Shorey, Sneh Bala Sinha

TL;DR
This paper investigates the irreducibility of certain Laguerre polynomials with negative arguments, extending previous results and providing new bounds on their factorization properties.
Contribution
It proves that, except for finitely many cases, these polynomials are either irreducible or have a linear factor times an irreducible polynomial, improving earlier estimates.
Findings
Proves irreducibility for most cases of the polynomial family.
Establishes a new inequality s > 1.9k for polynomial factors.
Sharpens previous bounds by Shorey, Tijdeman, and Nair.
Abstract
We consider the irreducibility of polynomial where is a negative integer. We observe that the constant term of vanishes if and only if . Therefore we assume that where is a non-negative integer. Let and more general polynomial, let where with are integers such that . Schur was the first to prove the irreducibility of for . It has been proved that is irreducibile for . In this paper, by a different method, we prove : Apart from finitely many explicitely given posibilities, either is irreducible or is linear factor times irreducible polynomial. This is a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Mathematical functions and polynomials · Advanced Mathematical Identities
