Almost sure behavior of the zeros of iterated derivatives of random polynomials
Abstract
Let Z1,\, Z2,… be independent and identically distributed complex random variables with common distribution μ and set Pn(z) := (z - Z1)·s (z - Zn)\,. Recently, Angst, Malicet and Poly proved that the critical points of Pn converge in an almost-sure sense to the measure μ as n tends to infinity, thereby confirming a conjecture of Cheung-Ng-Yam and Kabluchko. In this short note, we prove for any fixed k∈ N, the empirical measure of zeros of the kth derivative of Pn converges to μ in the almost sure sense, as conjectured by Angst-Malicet-Poly.
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.