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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
