The two-critical-point refinement conjecture for Sendov's conjecture

About 1 year old · traced to

Let β∈[0,1]\beta\in[0,1], let S(β)S(\beta) be the set of polynomials of degree at least 22 with complex coefficients, all roots in the closed unit disk, and at least one root at β\beta, and let d(P,β)d(P,\beta) be the distance from β\beta to the closest root of P′P'. The two-critical-point refinement conjecture. If P∈S(β)P\in S(\beta) has at most 22 distinct critical points, then

d(P,β)≤1−310β(1−β).d(P,\beta)\le1-\frac{3}{10}\beta(1-\beta).

The coefficient is motivated by numerical experiments and the paper's results for the cases where the degree is or is not divisible by 33. The general assertion for this class remains open.

References

Primary source

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

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.