2016
DOI: 10.1093/imrn/rnw199
|View full text |Cite
|
Sign up to set email alerts
|

Descartes’ Rule of Signs for Polynomial Systems Supported on Circuits

Abstract: Abstract. We give a multivariate version of Descartes' rule of signs to bound the number of positive real roots of a system of polynomial equations in n variables with n+2 monomials, in terms of the sign variation of a sequence associated both to the exponent vectors and the given coefficients. We show that our bound is sharp and is related to the signature of the circuit.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 12 publications
(14 citation statements)
references
References 14 publications
0
14
0
Order By: Relevance
“…This happens when the exponent vectors of the original polynomial system are not in convex position and a sign condition holds on the coefficient matrix. Such sign conditions are also found in recent work giving very strong bounds on positive solutions [6,9,19] and are considered to be multivariate versions of Descartes' rule of signs.…”
mentioning
confidence: 67%
“…This happens when the exponent vectors of the original polynomial system are not in convex position and a sign condition holds on the coefficient matrix. Such sign conditions are also found in recent work giving very strong bounds on positive solutions [6,9,19] and are considered to be multivariate versions of Descartes' rule of signs.…”
mentioning
confidence: 67%
“…We will give the proof of Theorem 1.5 in Section 3.3, where we restate the sign conditions on the minors of A and B in terms of oriented matroids. Based on this approach, a generalization for multivariate polynomials systems in n variables with n + 2 distinct monomials is given in [11]. This case shows the intricacy inherent in the pursuit of a full generalization of Descartes' rule to the multivariate case.…”
Section: Application To Real Algebraic Geometrymentioning
confidence: 99%
“…is infeasible, that is, the system (11) has no solution z = (x, y) ∈ R r+n . Linear inequalities arise from the sign equalities in (11). Some of these are strict inequalities and hence techniques from linear programming do not directly apply.…”
Section: Algorithmic Verification Of Sign Conditionsmentioning
confidence: 99%
“…Requiring in addition that the conic passes through α 1 We leave it for the reader to verify that, with these coefficients, the polynomia P (x) evaluated at x = α 3 is equal to H (α 1 , α 2 , α 3 ).…”
Section: Rationality Of the Cuspidal Locusmentioning
confidence: 99%
“…In this approach, one considers the family of all polynomials which can be expressed using a fixed set (the support set) A of exponent vectors α. For example, in [1] the bound on the number of positive solutions of a system of equations supported on a circuit was sharpened by considering in addition the combinatorics of A.…”
Section: Introductionmentioning
confidence: 99%