Leaky Roots and Stable Gauss-Lucas Theorems
Abstract
Let p:C → C be a polynomial. The Gauss-Lucas theorem states that its critical points, p'(z) = 0, are contained in the convex hull of its roots. A recent quantitative version Totik shows that if almost all roots are contained in a bounded convex domain K ⊂ C, then almost all roots of the derivative p' are in a -neighborhood K (in a precise sense). We prove another quantitative version: if a polynomial p has n roots in K and cK, (n/n) roots outside of K, then p' has at least n-1 roots in K. This establishes, up to a logarithm, a conjecture of the first author: we also discuss an open problem whose solution would imply the full conjecture.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.