2000 character limit reached
A sharp growth condition for a fast escaping spider's web (1208.3371v1)
Published 16 Aug 2012 in math.DS and math.CV
Abstract: We show that the fast escaping set $A(f)$ of a transcendental entire function $f$ has a structure known as a spider's web whenever the maximum modulus of $f$ grows below a certain rate. We give examples of entire functions for which the fast escaping set is not a spider's web which show that this growth rate is best possible. By our earlier results, these are the first examples for which the escaping set has a spider's web structure but the fast escaping set does not. These results give new insight into a conjecture of Baker and a conjecture of Eremenko.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.