Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Nearly irreducibility of polynomials and the Newton diagrams

Mateusz Masternak — 2020

Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica

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.

Page 1

Download Results (CSV)