The arc length of a random lemniscate

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…