Papers
Topics
Authors
Recent
Search
2000 character limit reached

Eremenko points and the structure of the escaping set

Published 31 Mar 2017 in math.DS and math.CV | (1703.11001v1)

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)\setminus D$ has uncountably many unbounded components for any open disc $D$ that meets the Julia set of $f$. For the set $A_R(f)$, which is the `core' of the fast escaping set, we prove the much stronger result that for some $R>0$ either $A_R(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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.