Bézout’s inequality for real polynomials
Date
2017Metadata
Show full item recordAbstract
Let F(X, Y ), G(X, Y ) be polynomials of degrees m, n > 0 respectively. We prove, that the set {(x, y) Є R² : F(x, y) = G(x, y) = 0} has at most mn connected components.
Collections
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Uznanie autorstwa-Użycie niekomercyjne-Bez utworów zależnych 3.0 Polska