Miller's quadratic refinement conjecture for Sendov's problem

At least 22 years old · documented by

Let S(β)S(\beta) be the set of polynomials of degree at least 22 with complex coefficients, all roots in the unit disk and at least one root at β\beta. For P∈S(β)P\in S(\beta), let d(P,β)d(P,\beta) be the distance between β\beta and the closest root of P′P', and define

r(β)=sup⁡{d(P,β):P∈S(β)}.r(\beta)=\sup\{d(P,\beta):P\in S(\beta)\}.

By rotation, assume 0≤β≤10\leq\beta\leq 1. Miller's quadratic refinement conjecture. For every β∈[0,1]\beta\in[0,1],

r(β)≤1−310β(1−β).r(\beta)\leq 1-\frac{3}{10}\beta(1-\beta).

This strengthens Sendov's conjectured bound while preserving equality at the endpoints β=0\beta=0 and β=1\beta=1. The paper proves it for polynomials of degree 22 or 33, for real polynomials of degree 44, and in several further special cases, but leaves the general assertion open.

References

Primary source

Michael Miller, “The best possible quadratic refinement of Sendov's conjecture”, arXiv:math/0312130 (2004).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.