Richards' static Gauss–Lucas conjecture
For a bounded convex set , an , and a polynomial , let be the -neighborhood of and let denote the number of zeros of in . Richards' static Gauss–Lucas conjecture. For every bounded convex set and every , there is a constant such that, for every polynomial of sufficiently large degree, if
then
This conjecture proposes a finite-degree principle underlying the asymptotic Gauss–Lucas theorem: if sufficiently many zeros of a high-degree polynomial lie in a convex set, then nearly as many critical points lie in every prescribed neighborhood of that set. Its resolution is not given in the source.
References
Primary source
Trevor J. Richards, “Some Recent Results on the Geometry of Complex Polynomials: The Gauss–Lucas Theorem, Polynomial Lemniscates, Shape Analysis, and Conformal Equivalence”, arXiv:1910.01159 (2020).
Progress summary
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.