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 27 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 77 tok/s Pro
Kimi K2 200 tok/s Pro
GPT OSS 120B 427 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Seeking a quadratic refinement of Sendov's conjecture (2506.12951v1)

Published 15 Jun 2025 in math.CV

Abstract: A conjecture of Sendov states that if a polynomial has all its roots in the unit disk and if $\beta$ is one of those roots, then within one unit of $\beta$ lies a root of the polynomial's derivative. If we define $r(\beta)$ to be the greatest possible distance between $\beta$ and the closest root of the derivative, then Sendov's conjecture claims that $r(\beta) \le 1$. In this paper, we conjecture that there is a constant $c>0$ so that $r(\beta) \le 1-c\beta(1-\beta)$ for all $\beta \in [0,1]$. We find such constants for complex polynomials of degree $2$ and $3$, for real polynomials of degree $4$, for all polynomials whose roots lie on a line, for all polynomials with exactly one distinct critical point, and when $\beta$ is sufficiently close to $1$. In addition, we conjecture a specific estimate for a value of $c$ that would apply to polynomials of any degree.

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.

Authors (1)

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

Collections

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

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 tweet and received 0 likes.

Upgrade to Pro to view all of the tweets about this paper: