Extremal univalent polynomials are classified by bi-angled trees and are in canonical bijection with anti-holomorphic polynomials with all critical points fixed.
Sharpness of connectivity bounds for quadrature domains
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
math.CV 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Univalent Polynomials and Hubbard Trees
Extremal univalent polynomials are classified by bi-angled trees and are in canonical bijection with anti-holomorphic polynomials with all critical points fixed.