2000 character limit reached
Optimal Descartes' Rule of Signs for Circuits
Published 19 Oct 2020 in math.AG and cs.SC | (2010.09165v2)
Abstract: We present an optimal version of Descartes' rule of signs to bound the number of positive real roots of a sparse system of polynomial equations in n variables with n+2 monomials. This sharp upper bound is given in terms of the sign variation of a sequence associated to the exponents and the coefficients of the system.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.