Papers
Topics
Authors
Recent
Search
2000 character limit reached

The structure of spider's web fast escaping sets

Published 1 Nov 2010 in math.DS and math.CV | (1011.0359v1)

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

Paper to Video (Beta)

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.

Authors (1)

Collections

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