A quadratic refinement of Sendov's conjecture

From papers

Let β\beta be a real number in [0,1][0,1]. For a polynomial PP of degree at least 22 with complex coefficients, all roots in the closed unit disk, and at least one root at β\beta, let d(P,β)d(P,\beta) be the distance from β\beta to the closest root of PP', and define

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

where S(β)S(\beta) is the set of such polynomials. The quadratic refinement of Sendov's conjecture. There is a constant c>0c>0 such that

r(β)1cβ(1β)for all β[0,1].r(\beta)\le 1-c\beta(1-\beta)\qquad\text{for all }\beta\in[0,1].

This strengthens Sendov's conjectured bound r(β)1r(\beta)\le1 by requiring a uniform positive improvement away from the endpoints. The paper verifies the bound for several special classes and low degrees, but the general assertion remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Michael J. Miller, “Seeking a quadratic refinement of Sendov's conjecture”, arXiv:2506.12951 (2025).

Solutions 0

No solutions have been posted yet.