Number of components of polynomial lemniscates: a problem of Erd\"os, Herzog, and Piranian
Abstract
Let K⊂C be a compact set in the plane whose logarithmic capacity c(K) is strictly positive. Let Pn(K) be the space of monic polynomials of degree n, all of whose zeros lie in K. For p∈ Pn(K), its filled unit leminscate is defined by p = \z: |p(z)| < 1\. Let C(p) denote the number of connected components of the open set p, and define Cn(K) = p∈ Pn(K)C(p). In this paper we show that the quantity \[M(K) = n∞Cn(K)n,\] satisfies M(K) < 1 when the logarithmic capacity c(K) < 1, and M(K) = 1 when c(K)≥ 1. In particular, this answers a question of Erd\"os et. al. posed in 1958. In addition, we show that for nice enough compact sets whose capacity is strictly bigger than 12, the quantity m(K) = n∞Cn(K)n > 0.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.