Related papers: Further than Descartes' rule of signs
A sequence of $d+1$ signs $+$ and $-$ beginning with a $+$ is called a {\em sign pattern (SP)}. We say that the real polynomial $P:=x^d+\sum _{j=0}^{d-1}a_jx^j$, $a_j\neq 0$, defines the SP $\sigma :=(+$,sgn$(a_{d-1})$, $\ldots$,…
For a real degree $d$ polynomial $P$ with all nonvanishing coefficients, with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients ($c+p=d$), Descartes' rule of signs says that $P$ has $pos\leq c$ positive and…
We consider three realization problems about monic real univariate polynomials without vanishing coefficients. Such a polynomial $P:=\sum_{j=0}^db_jx^j$ defines the sign pattern $\sigma (P):=({\rm sgn}(b_d)$, $\ldots$, ${\rm sgn}(b_0))$.…
By Descartes' rule of signs, a real degree $d$ polynomial $P$ with all nonvanishing coefficients, with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients ($c+p=d$) has $pos\leq c$ positive and $neg\leq p$…
The classical Descartes' rule of signs limits the number of positive roots of a real polynomial in one variable by the number of sign changes in the sequence of its coefficients. One can ask the question which pairs of nonnegative integers…
We consider polynomials $Q:=\sum _{j=0}^da_jx^j$, $a_j\in \mathbb{R}^*$, with all roots real. When the {\em sign pattern} $\sigma (Q):=({\rm sgn}(a_d),{\rm sgn}(a_{d-1})$, $\ldots$, ${\rm sgn}(a_0))$ has $\tilde{c}$ sign changes, the…
Given a real univariate degree $d$ polynomial $P$, the numbers $pos_k$ and $neg_k$ of positive and negative roots of $P^{(k)}$, $k=0$, $\ldots$, $d-1$, must be admissible, i.e. they must satisfy certain inequalities resulting from Rolle's…
The famous Descartes' rule of signs from 1637 giving an upper bound on the number of positive roots of a real univariate polynomials in terms of the number of sign changes of its coefficients, has been an indispensable source of inspiration…
For a univariate real polynomial without zero coefficients, Descartes' rule of signs (completed by an observation of Fourier) says that its numbers $pos$ of positive and $neg$ of negative roots (counted with multiplicity) are majorized…
We study real univariate polynomials with non-zero coefficients and with all roots real, out of which exactly two positive. The sequence of coefficients of such a polynomial begins with $m$ positive coefficients followed by $n$ negative…
We consider real polynomials in one variable without vanishing coefficients and with all roots real and of distinct moduli. We show that the signs of the coefficients define the order of the moduli of the roots on the real positive…
What can we deduce about the roots of a real polynomial in one variable by simply considering the signs of its coefficients? On one hand, we give a complete answer concerning the positive roots, by proposing a statement of Descartes' rule…
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…
We investigate the signed support, that is, the set of the exponent vectors and the signs of the coefficients, of a multivariate polynomial $f$. We describe conditions on the signed support ensuring that the semi-algebraic set, denoted as…
If c is a positive number, Descartes' rule of signs implies that multiplying a polynomial f(x) by c - x introduces an odd number of changes of sign in the coefficients. We turn this around, proving this fact about sign changes inductively…
We consider univariate real polynomials with all roots real and with two sign changes in the sequence of their coefficients which are all non-vanishing. One of the changes is between the linear and the constant term. By Descartes' rule of…
We give partial generalizations of the classical Descartes' rule of signs to multivariate polynomials (with real exponents), in the sense that we provide upper bounds on the number of connected components of the complement of a hypersurface…
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…
A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the…
A real polynomial $P(X_1,..., X_n)$ sign represents $f: A^n \to \{0,1\}$ if for every $(a_1, ..., a_n) \in A^n$, the sign of $P(a_1,...,a_n)$ equals $(-1)^{f(a_1,...,a_n)}$. Such sign representations are well-studied in computer science and…