2000 character limit reached
Univalent Wandering Domains in the Eremenko-Lyubich Class
Published 29 Nov 2017 in math.CV | (1711.10629v2)
Abstract: We use the folding theorem of Bishop to construct an entire function $f$ in class $B$ and a wandering domain $U$ of $f$ such that $f$ restricted to $fn(U)$ is univalent, for all $n \geq 0$. The components of the wandering orbit are bounded and surrounded by the postcritical set.
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.