The best possible quadratic refinement of Sendov's conjecture

Details The best possible quadratic refinement of Sendov's conjecture The best possible quadratic refinement of Sendov's conjecture

2003-12-05

arxiv.org/abs/math/0312130v2

Mathematics

Complex Variables

5 pages, AMS-LaTeX, no figures. v2: proved Conjecture 1 for polynomials with all roots on a line, noted additional implication

Scientific paper

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 assume (without loss of generality) that $0 \le \beta \le 1$ and make the stronger conjecture that $r(\beta) \le 1-(3/10)\beta(1-\beta)$. We prove this new conjecture for all polynomials of degree 2 or 3, for all real polynomials of degree 4, and for all polynomials of any degree as long as all their roots lie on a line or $\beta$ is sufficiently close to 1.

Affiliated with

Also associated with

No associations

Rating

The best possible quadratic refinement of Sendov's conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The best possible quadratic refinement of Sendov's conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The best possible quadratic refinement of Sendov's conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-237548