Eremenko points and the structure of the escaping set
Abstract
Much recent work on the iterates of a transcendental entire function f has been motivated by Eremenko's conjecture that all the components of the escaping set I(f) are unbounded. Here we show that if I(f) is disconnected, then the set I(f) D has uncountably many unbounded components for any open disc D that meets the Julia set of f. For the set AR(f), which is the `core' of the fast escaping set, we prove the much stronger result that for some R>0 either AR(f) is connected and has the structure of an infinite spider's web or it has uncountably many components each of which is unbounded. There are analogous results for the intersections of these sets with the Julia set when no multiply connected wandering domains are present, but strikingly different results when they are present. In proving these, we obtain the unexpected result that multiply connected wandering domains can have complementary components with no interior, indeed uncountably many.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.