Optimal Descartes' rule of signs for systems supported on circuits

DOI10.1007/S00208-021-02216-4MaRDI QIDQ832477zbMATH OpenOpenAlexFDO

Authors Frédéric Bihan, Alicia Dickenstein, Jens Forsgård

Publication date 25 March 2022

Published in Mathematische Annalen (Search for Journal in Brave)

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

zbMATH Keywords

Descartes' rule of signspolynomial systemsparse system

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real algebraic sets (14P05) Computational real algebraic geometry (14Q30) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

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.

Review text

Fix an ordered exponent set \(\mathcal{A}:=\{ a_0,a_1,\ldots ,a_{n+1}\}\), \(a_j\in \mathbb{Z}^n\). For any coefficient matrix \(C=(c_{i,j})\in \mathbb{R}^{n\times (n+2)}\), consider the sparse polynomial system in \(n\) variables \(x=(x_1,\ldots , x_n)\) with support \(\mathcal{A}\): \(f_i(x)=\sum_{j=0}^{n+1}c_{i,j}x^{a_j}=0\). The authors present an optimal version of Descartes' rule of signs to bound the number of positive real roots of the system. 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.

Recommendations

• Descartes' rule of signs for polynomial systems supported on circuits
• Descartes' Rule of Signs Revisited
• Characterizations of the Optimal Descartes' Rules of Signs
• On Descartes' rules of signs and their exactness
• On generalizing Descartes' rule of signs to hypersurfaces

Cites work

• Characterization of circuits supporting polynomial systems with the maximal number of positive solutions
• Descartes' rule of signs for polynomial systems supported on circuits
• scientific article; zbMATH DE number 3528170 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 711287 (Why is no real title available?)
• Interpolation and approximation by polynomials
• Lower bounds for positive roots and regions of multistationarity in chemical reaction networks
• Multivariate Descartes' rule
• New fewnomial upper bounds from Gale dual polynomial systems
• On the Newton polytope of the resultant
• The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings

Cited in

(12)

• Polynomials that sign represent parity and Descartes' rule of signs
• On generalizing Descartes' rule of signs to hypersurfaces
• Sign conditions for the existence of at least one positive solution of a sparse polynomial system
• Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
• scientific article; zbMATH DE number 1066972 (Why is no real title available?)
• Characterizations of the Optimal Descartes' Rules of Signs
• Descartes' rule of signs for polynomial systems supported on circuits
• scientific article; zbMATH DE number 5251651 (Why is no real title available?)
• Geometry of the signed support of a multivariate polynomial and Descartes' rule of signs
• Parametrized systems of generalized polynomial inequalities via linear algebra and convex geometry
• Sparse systems with high local multiplicity
• Positive equilibria in mass action networks: geometry and bounds

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)