A generalization of Dumas irreducibility criterion

Abstract

Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of Dumas.

10 pages; The statement and proof of Lemma 8 have been revised and corrected, Proof of Theorem 1 is rewritten