The two-critical-point refinement conjecture for Sendov's conjecture
The two-critical-point refinement conjecture for Sendov's conjecture
Let , let be the set of polynomials of degree at least with complex coefficients, all roots in the closed unit disk, and at least one root at , and let be the distance from to the closest root of . The two-critical-point refinement conjecture. If has at most distinct critical points, then
The coefficient is motivated by numerical experiments and the paper's results for the cases where the degree is or is not divisible by . The general assertion for this class 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
Sign in to submit a solution.
No solutions have been posted yet.