Communications in Algebra · 2015 · 10 citations · 12 references
Natural SciencesMathematicsAlgebraNumber TheoryTheory Of ComputationAlgebraic Number TheoryArithmetic GeometryCombinatorial Number TheoryIrreducibility
The famous irreducibility criteria of Schönemann–Eisenstein and Dumas rely on information on the divisibility of the coefficients of a polynomial by a single prime number. In this paper, we will use some results and ideas of Dumas to provide several irreducibility criteria of Schönemann–Eisenstein–Dumas-type for polynomials with integer coefficients, criteria that are given by some divisibility conditions for their coefficients with respect to arbitrarily many prime numbers. A special attention will be paid to those irreducibility criteria that require information on the divisibility of the coefficients by two distinct prime numbers.
12
On the irreducibility of the generalized Laguerre polynomials
Michael Filaseta, T. Y. Lam · Acta Arithmetica · 2002 · 62 citations · Full text
The irreducibility of all but finitely many Bessel Polynomials
Michael Filaseta · Acta Mathematica · 1995 · 39 citations · Full text
On a generalization of Eisenstein's irreducibility criterion
Sudesh K. Khanduja, Jayanti Saha · Mathematika · 1997 · 27 citations