The arc length and topology of a random lemniscate
From MaRDI portal
Publication:4600964
DOI10.1112/JLMS.12086zbMATH Open1417.60040arXiv1610.09791OpenAlexW2767246536MaRDI QIDQ4600964FDOQ4600964
Authors: Erik Lundberg, Koushik Ramachandran
Publication date: 18 January 2018
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1610.09791
Recommendations
Random fields (60G60) Polynomials and rational functions of one complex variable (30C10) Integral geometry (53C65)
Cited In (7)
- The Arc Length of the Lemniscate { | p(z) | = 1}
- On the geometry of random lemniscates
- On the number of components of random polynomial lemniscates
- The lemniscate tree of a random polynomial
- Some recent results on the geometry of complex polynomials: the Gauss-Lucas theorem, polynomial lemniscates, shape analysis, and conformal equivalence
- Inradius of random lemniscates
- 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)