Optimal Descartes' Rule of Signs for Circuits

10/19/2020
by   Frédéric Bihan, et al.
0

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.

READ FULL TEXT
research
01/21/2016

Descartes' Rule of Signs for Polynomial Systems supported on Circuits

We give a multivariate version of Descartes' rule of signs to bound the ...
research
07/21/2021

On generalizing Descartes' rule of signs to hypersurfaces

We give partial generalizations of the classical Descartes' rule of sign...
research
10/13/2016

Upper bound for effective differential elimination

We present an upper bound for the number of differentiations in differen...
research
07/19/2017

An Efficient Version of the Bombieri-Vaaler Lemma

In their celebrated paper "On Siegel's Lemma", Bombieri and Vaaler found...
research
09/07/2023

On generalized corners and matrix multiplication

Suppose that S ⊆ [n]^2 contains no three points of the form (x,y), (x,y+...
research
04/25/2018

On The Complexity of Sparse Label Propagation

This paper investigates the computational complexity of sparse label pro...
research
12/11/2016

A-Discriminants for Complex Exponents, and Counting Real Isotopy Types

We extend the definition of A-discriminant varieties, and Kapranov's par...

Please sign up or login with your details

Forgot password? Click here to reset