Nearly irreducibility of polynomials and the Newton diagrams
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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | deu |
| Published: |
Wydawnictwo Naukowe Uniwersytetu Pedagogicznego
2020-01-01
|
| Series: | Annales Universitatis Paedagogicae Cracoviensis: Studia Mathematica |
| Subjects: | |
| Online Access: | https://studmath.up.krakow.pl/index.php/studmath/article/view/7329 |