TY - JOUR
AU - Masternak, Mateusz
PY - 2020/01/22
Y2 - 2023/11/29
TI - Nearly irreducibility of polynomials and the Newton diagrams
JF - Annales Universitatis Paedagogicae Cracoviensis Studia Mathematica
JA - Ann. Univ. Paedagog. Crac. Stud. Math.
VL - 19
IS -
SE - Published
DO -
UR - https://studmath.up.krakow.pl/article/view/7329
SP - 65-77
AB - 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 C2. In the paper we give a criterion of nearly irreducibility for a given polynomial f in terms of its Newton diagram.
ER -