The arc length of a random lemniscate
Abstract: A polynomial lemniscate is a curve in the complex plane defined by ${z \in \mathbb{C}:|p(z)|=t}$. Erd\"os, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate $\Lambda={ z \in \mathbb{C}:|p(z)|=1}$ when $p$ is a monic polynomial of degree $n$. In this paper, we study the length and topology of a random lemniscate whose defining polynomial has independent Gaussian coefficients. In the special case of the Kac ensemble we show that the length approaches a nonzero constant as $n \rightarrow \infty$. We also show that the average number of connected components is asymptotically $n$, and we observe a positive probability (independent of $n$) of a giant component occurring.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.