Copy the page URI to the clipboard
Rippon, P. J. and Stallard, G. M.
(2013).
DOI: https://doi.org/10.1016/j.aim.2013.04.021
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. The proof uses a new local version of the cos πρ theorem, based on a comparatively unknown result of Beurling. We also give examples of entire functions for which the fast escaping set is not a spider’s web which show that this growth rate is sharp. These are the first examples for which the escaping set has a spider’s web structure but the fast escaping set does not. Our results give new insight into possible approaches to proving a conjecture of Baker, and also a conjecture of Eremenko.
Viewing alternatives
Metrics
Public Attention
Altmetrics from AltmetricNumber of Citations
Citations from Dimensions- Request a copy from the author This file is not available for public download
Item Actions
Export
About
- Item ORO ID
- 37990
- Item Type
- Journal Item
- ISSN
- 1090-2082
- Project Funding Details
-
Funded Project Name Project ID Funding Body Baker's conjecture and Eremenko's conjecture: a unified approach. EP/H006591/1 EPSRC (Engineering and Physical Sciences Research Council) - Keywords
- fast escaping set; spiders’ webs; cos πρ theorem
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Copyright Holders
- © 2013 Published by Elsevier Inc.
- Depositing User
- Philip Rippon