Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 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

The structure of spider's web fast escaping sets (1011.0359v1)

Published 1 Nov 2010 in math.DS and math.CV

Abstract: Building on recent work by Rippon and Stallard, we explore the intricate structure of the spider's web fast escaping sets associated with certain transcendental entire functions. Our results are expressed in terms of the components of the complement of the set (the 'holes' in the web). We describe the topology of such components and give a characterisation of their possible orbits under iteration. We show that there are uncountably many components having each of a number of orbit types, and we prove that components with bounded orbits are quasiconformally homeomorphic to components of the filled Julia set of a polynomial. We also show that there are singleton periodic components and that these are dense in the Julia set.

Summary

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