Local connectivity of Julia sets of some rational maps with Siegel disks
Shuyi Wang, Fei Yang, Gaofei Zhang, Yanhua Zhang
TL;DR
The paper addresses the local connectivity of Julia sets for rational maps with bounded-type Siegel disks by developing a puzzle-free framework. It introduces a quasi-Blaschke model G that captures exterior dynamics of f and proves a uniform contraction property for long inverse-branch compositions near the Siegel boundary, circumventing the need for puzzles. The key instrument is the Main Lemma', which controls pullbacks via (,)-admissible sequences and their contraction regions to force diameters to shrink uniformly; this underpins local connectivity via Whyburn's criterion. Applications include local connectivity for cubic Siegel polynomials along the Zakeri curve and for certain Newton and McMullen maps, extending Petersen's results to a broader class of rational maps with Siegel disks.
Abstract
We prove that a long iteration of rational maps is expanding near boundaries of bounded type Siegel disks. This leads us to extend Petersen's local connectivity result on the Julia sets of quadratic Siegel polynomials to a general case. A new key feature in the proof is that the puzzles are not used.
