Nearly irreducibility of polynomials and the Newton diagrams

2019/05/06 by Masternak, Mateusz
#11R09 #14H50 #52B20 #Algebraic Geometry (math.AG) #FOS: Mathematics

paper · doi:10.48550/arxiv.1905.02288

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 the paper we give a criterion of nearly irreducibility for a given polynomial f in terms of its Newton diagram.

Related

• Irreducibility of a sum of polynomials depending on disjoint sets of variables
• Irreducibility criterion for quasi-ordinary polynomials
• A note about irreducibility of a resultant
• Irreducibility criteria for pairs of polynomials whose resultant is a prime number
• Eventual Stability of pure polynomials over the rational field