The low-degree extremal values conjecture for Sendov's refinement

From papers

For n2n\ge2, let rn(β)r_n(\beta) be the maximum of d(P,β)d(P,\beta) over PS(β)P\in S(\beta) of degree nn, and let cnc_n denote the corresponding sharp quadratic-refinement coefficient in the bound d(P,β)1cnβ(1β)d(P,\beta)\le1-c_n\beta(1-\beta). The experimentally conjectured values are listed in Table 2: c4=1/3c_4=1/3, c5=3/10c_5=3/10, c6=0.365121611819106c_6=0.365121611819106, c7=0.335088765359222c_7=0.335088765359222, and c8=(842)/70.334735107215374c_8=(8-4\sqrt2)/7\approx0.334735107215374. The low-degree extremal values conjecture. The conjectured values of cnc_n listed in Table 2 are the correct values. These values would substantially improve the bounds supplied by Sendov's conjecture for the indicated degrees, but the assertion is based on experimental data and 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.