The arc length and topology of a random lemniscate

From MaRDI portal
Publication:4600964




Abstract: A polynomial lemniscate is a curve in the complex plane defined by zinmathbbC:|p(z)|=t. Erd"os, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate Lambda=zinmathbbC:|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 nightarrowinfty. 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.









This page was built for publication: The arc length and topology of a random lemniscate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600964)