On a factorization result of Ştefănescu

Abstract

Ştefănescu proved an elegant factorization result for polynomials over discrete valuation domains [‘On the factorization of polynomials over discrete valuation domains’, Versita 22:1 (2014), 273–280]. We generalize Ştefănescu’s result to include a larger class of polynomials over such domains.

Keywords:

• Discrete valuation domain
• Dumas irreducibility criterion
• Eisenstein irreducibility criterion
• factorization
• irreducibility
• Newton index
• polynomials
• Schönemann irreducibility criterion

2020 Mathematics Subject Classification:

• Primary: 30C10
• 12E05
• 11C08

Acknowledgments

The authors are highly indebted to the anonymous referees for useful comments.