Pith. sign in

REVIEW 2 cited by

Sharpness of connectivity bounds for quadrature domains

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1411.3415 v1 pith:JDFTUURQ submitted 2014-11-13 math.CV

Seung-Yeop Lee , Nikolai Makarov This is my paper · ORCID
classification math.CV
keywords boundsconnectivitysharpnessapplicationsdependsdiscussdomainsequation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Univalent Polynomials and Hubbard Trees

    math.CV 2019-08 conditional novelty 8.0 of 10

    Extremal univalent polynomials are classified by bi-angled trees and are in canonical bijection with anti-holomorphic polynomials with all critical points fixed.

  2. Algebraic correspondences and Schwarz reflections: Where rational dynamics meets Kleinian groups

    math.DS 2025-11 unverdicted novelty 1.0 of 10

    Algebraic correspondences mate rational maps with Kleinian groups, and the modular Mandelbrot set is homeomorphic to the Mandelbrot set—this survey reports those results.

Pith tools