The spider's-web conjecture for the quite fast escaping set
The spider's-web conjecture for the quite fast escaping set
Let be a transcendental entire function of order less than . For each , define
where is the maximum modulus, and let be the quite fast escaping set obtained from the iterates of . A spider's web is a connected set containing boundaries of a nested sequence of bounded simply connected domains whose union is the whole plane.
Quite fast escaping set conjecture. The set contains a spider's web. Consequently, is a spider's web and is connected.
The conjecture extends results for several families of entire functions of order less than . The authors state that they know no counterexamples, while the assertion remains open in general.
Sources & referencesView supporting material
Primary source
Daniel A. Nicks, Philip J. Rippon and Gwyneth M. Stallard, “Eremenko's conjecture for functions with real zeros: the role of the minimum modulus”, arXiv:1810.07814 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.