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 . Erd"os, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate when is a monic polynomial of degree . 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 . We also show that the average number of connected components is asymptotically , and we observe a positive probability (independent of ) of a giant component occurring.
Recommendations
Cited in
(9)- Some recent results on the geometry of complex polynomials: the Gauss-Lucas theorem, polynomial lemniscates, shape analysis, and conformal equivalence
- On the geometry of random lemniscates
- The lemniscate tree of a random polynomial
- Number of components of polynomial lemniscates: a problem of Erdös, Herzog, and Piranian
- Asymptotics for the expected number of nodal components for random lemniscates
- Inradius of random lemniscates
- On the number of components of random polynomial lemniscates
- The Arc Length of the Lemniscate { | p(z) | = 1}
- Expected number and distribution of critical points of real Lefschetz pencils
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)