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 24 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 113 tok/s Pro
Kimi K2 216 tok/s Pro
GPT OSS 120B 428 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Descartes' rule of signs, Rolle's theorem and sequences of admissible pairs (1805.04261v1)

Published 11 May 2018 in math.CA

Abstract: 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 theorem and from Descartes' rule of signs. For $1\leq d\leq 5$, we give the answer to the question for which admissible $d$-tuples of pairs $(pos_k$, $neg_k)$ there exist polynomials $P$ with all nonvanishing coefficients such that for $k=0$, $\ldots$, $d-1$, $P{(k)}$ has exactly $pos_k$ positive and $neg_k$ negative roots all of which are simple.

Citations (2)

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.