Expansivity properties and rigidity for non-recurrent exponential maps

Abstract

We show that an exponential map fc(z)=ez+c whose singular value c is combinatorially non-recurrent and non-escaping is uniquely determined by its combinatorics, i.e. the pattern in which its dynamic rays land together. We do this by constructing puzzles and parapuzzles in the exponential family. We also prove a theorem about hyperbolicity of the postsingular set in the case that the singular value is non-recurrent. Finally, we show that boundedness of the postsingular set implies combinatorial non-recurrence if c is in the Julia set.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…