Nearly irreducibility of polynomials and the Newton diagrams

Abstract

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero in C 2 . In the paper we give a criterion of nearly irreducibility for a given polynomial f in terms of its Newton diagram.