English

The arc length of a random lemniscate

Probability 2017-11-15 v2 Classical Analysis and ODEs Complex Variables

Abstract

A polynomial lemniscate is a curve in the complex plane defined by {zC:p(z)=t}\{z \in \mathbb{C}:|p(z)|=t\}. Erd\"os, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate Λ={zC:p(z)=1}\Lambda=\{ z \in \mathbb{C}:|p(z)|=1\} when pp is a monic polynomial of degree nn. 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 nn \rightarrow \infty. We also show that the average number of connected components is asymptotically nn, and we observe a positive probability (independent of nn) of a giant component occurring.

Keywords

Cite

@article{arxiv.1610.09791,
  title  = {The arc length of a random lemniscate},
  author = {Erik Lundberg and Koushik Ramachandran},
  journal= {arXiv preprint arXiv:1610.09791},
  year   = {2017}
}

Comments

19 pages, 7 figures. This version includes results on the connected components of the lemniscate