arXiv · 1905.02288
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 the paper we give a criterion of nearly irreducibility for a given polynomial f in terms of its Newton diagram.
Explore related subjects
Keep this discovery
Mateusz Masternak. 2019-05-06. Nearly irreducibility of polynomials and the Newton diagrams. https://arxiv.org/abs/1905.02288
Cite the original work for its findings. Save a collection to share your selection of sources.