Papers
Topics
Authors
Recent
Search
2000 character limit reached

The arc length of a random lemniscate

Published 31 Oct 2016 in math.PR, math.CA, and math.CV | (1610.09791v2)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.