Optimal Descartes' rule of signs for systems supported on circuits

From MaRDI portal
Publication:832477

DOI10.1007/S00208-021-02216-4zbMATH Open1487.14129arXiv2010.09165OpenAlexW3169600249MaRDI QIDQ832477FDOQ832477


Authors: Frédéric Bihan, Alicia Dickenstein, Jens Forsgård Edit this on Wikidata


Publication date: 25 March 2022

Published in: Mathematische Annalen (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2010.09165




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Optimal Descartes' rule of signs for systems supported on circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832477)