![Algorithms and Complexity in Algebraic Geometry_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Algorithms%20and%20Complexity%20in%20Algebraic%20Geometry_hi-res.jpg?h=450de763&itok=r3pqykMn)
Abstract
Descartes’ rule of signs bounds the number of positive roots of an univariate polynomial by the number of sign changes between consecutive coefficients. In particular, this produces a sharp bound depending on the number of monomials. Generalizing Descartes’ rule of signs or the corresponding sharp bound to the multivariable case is a challenging problem. In this talk, I will present a generalization of Descartes’ rule of signs for the number of positive solutions of any system of n real polynomial equations in n variables with at most n+2 monomials. This is a joint work with Alicia Dickenstein.