On the Shapes of Rational Lemniscates
Christopher J. Bishop, Alexandre Eremenko, Kirill Lazebnik
TL;DR
This work establishes that every lemniscate graph, including those with vertices, can be ε‑approximately realized as a rational lemniscate by a carefully constructed rational function with poles placed in prescribed grey-face locations. The authors reduce general graphs to the vertexless case via smoothing to analytic edges, and then build level-set approximations from sums of Green's functions, ultimately placing poles exactly through a fixed-point argument. They derive a quantitative Runge-type theorem with geometric convergence and prove an approximation of continua by Julia sets through rational maps with two attracting basins. The results unify topological, analytic, and dynamical perspectives on lemniscates, enabling control over topology, approximation rate, and Julia-set realizations with concrete geometric and harmonic-analytic tools.
Abstract
A rational lemniscate is a level set of $|r|$ where $r: \hat{\mathbb{C}} \rightarrow \hat{\mathbb{C}}$ is rational. We prove that any planar Euler graph can be approximated, in a strong sense, by a homeomorphic rational lemniscate. This generalizes Hilbert's lemniscate theorem; he proved that any Jordan curve can be approximated (in the same strong sense) by a polynomial lemniscate that is also a Jordan curve. As consequences, we obtain a sharp quantitative version of the classical Runge's theorem on rational approximation, and we give a new result on the approximation of planar continua by Julia sets of rational maps.
