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 C2. In the paper we give a criterion of nearly irreducibility for a given polynomial f in terms of its Newton diagram.
Language: English
Page range: 65 - 77
Submitted on: May 7, 2019
Accepted on: Nov 15, 2019
Published on: Dec 31, 2020
Published by: Pedagogical University of Cracow
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
© 2020 Mateusz Masternak, published by Pedagogical University of Cracow
This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 License.