Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Eremenko points and the structure of the escaping set (1703.11001v1)

Published 31 Mar 2017 in math.DS and math.CV

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

We haven't generated a summary for this paper yet.