Name
Abstract | ||
|---|---|---|
Let F(x,y)∈C[x,y] be a polynomial of degree d and let G(x,y)∈C[x,y] be a polynomial with t monomials. We want to estimate the maximal multiplicity of a solution of the system F(x,y)=G(x,y)=0. Our main result is that the multiplicity of any isolated solution (a,b)∈C2 with nonzero coordinates is no greater than 52d2t2. We ask whether this intersection multiplicity can be polynomially bounded in the number of monomials of F and G, and we briefly review some connections between sparse polynomials and algebraic complexity theory. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jpaa.2019.106279 | Journal of Pure and Applied Algebra |
Keywords | DocType | Volume |
14C17,14H50,14Q20 | Journal | 224 |
Issue | ISSN | Citations |
7 | 0022-4049 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pascal Koiran | 1 | 919 | 113.85 |
| Mateusz Skomra | 2 | 0 | 2.03 |