Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 64 tok/s Pro
Kimi K2 185 tok/s Pro
GPT OSS 120B 442 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

On Descartes' rule of signs (1905.01836v1)

Published 6 May 2019 in math.CA

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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