Sharpness of connectivity bounds for quadrature domains
classification
🧮 math.CV
keywords
boundsconnectivitysharpnessapplicationsdependsdiscussdomainsequation
read the original abstract
In this paper we prove the sharpness of connectivity bounds established in [15]. The proof depends on some facts in the theory of univalent polynomials. We also discuss applications to the equation $r(z)=\bar z$ where $r$ is a rational function.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.