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

Entire functions for which the escaping set is a spider's web (1012.1303v1)

Published 6 Dec 2010 in math.CV and math.DS

Abstract: We construct several new classes of transcendental entire functions, f, such that both the escaping set, I(f), and the fast escaping set, A(f), have a structure known as a spider's web. We show that some of these classes have a degree of stability under changes in the function. We show that new examples of functions for which I(f) and A(f) are spiders' webs can be constructed by composition, by differentiation, and by integration of existing examples. We use a property of spiders' webs to give new results concerning functions with no unbounded Fatou components.

Summary

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