Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Descartes' rule of signs

Published 6 May 2019 in math.CA | (1905.01836v1)

Abstract: A sequence of $d+1$ signs $+$ and $-$ beginning with a $+$ is called a {\em sign pattern (SP)}. We say that the real polynomial $P:=xd+\sum {j=0}{d-1}a_jxj$, $a_j\neq 0$, defines the SP $\sigma :=(+$,sgn$(a{d-1})$, $\ldots$, sgn$(a_0))$. By Descartes' rule of signs, for the quantity $pos$ of positive (resp. $neg$ of negative) roots of $P$, one has $pos\leq c$ (resp. $neg\leq p=d-c$), where $c$ and $p$ are the numbers of sign changes and sign preservations in $\sigma$; the numbers $c-pos$ and $p-neg$ are even. We say that $P$ realizes the SP $\sigma$ with the pair $(pos, neg)$. For SPs with $c=2$, we give some sufficient conditions for the (non)realizability of pairs $(pos, neg)$ of the form $(0,d-2k)$, $k=1$, $\ldots$, $[(d-2)/2]$.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.