Bulletin of the London Mathematical Society · 2020 · 14 citations · 4 references
Natural SciencesMathematicsAlgebraNumber TheoryTheory Of ComputationAlgebraic Number TheoryArithmetic GeometryPolynomial Factorization Over Finite Fields
In this article, we show that if f ( x ) = a n x n + a n − 1 x n − 1 + ⋯ + a 0 , a 0 ≠ 0 is a polynomial with rational coefficients and if there exists a prime p whose highest power r i dividing a i (where r i = ∞ if a i = 0 ) satisfies r n = 0 , n r i ⩾ ( n − i ) r 0 > 0 for 0 ⩽ i ⩽ n − 1 , then f ( x ) has at most gcd ( r 0 , n ) irreducible factors over the field Q of rational numbers and each irreducible factor has degree at least n / gcd ( r 0 , n ) over Q . This result extends the famous Eisenstein–Dumas irreducibility criterion. In fact, we prove our result in a more general setup for polynomials with coefficients in arbitrary valued fields.
4
Prime Numbers and Irreducible Polynomials
M. Ram Murty · American Mathematical Monthly · 2002 · 46 citations
On a generalization of Eisenstein's irreducibility criterion
Sudesh K. Khanduja, Jayanti Saha · Mathematika · 1997 · 27 citations
On an Irreducibility Criterion of M. Ram Murty
Kurt Girstmair · American Mathematical Monthly · 2005 · 14 citations