A combinatorial classification of postsingularly finite complex exponential maps
The paper is devoted to the study of dynamical systems given by iteration of exponential maps \(z\mapsto\lambda e^z=:E_\lambda(z)\). The main result is a combinatorial classification of exponential maps for which the origin \(z=0\) is preperiodic. This classification is given in terms of preperiodic external addresses (introduced in this paper), i.e., preperiodic sequences of integers. The results of this paper also contribute to the answer of a generalization of an old question of Euler: for which values \(a\in\mathbb{C}\), exists the limit \(a^{a^{a\cdots}}\)?
- On postsingularly finite exponential maps
- Triviality of fibers for Misiurewicz parameters in the exponential family
- Expansivity properties and rigidity for non-recurrent exponential maps
- Exponential Thurston maps and limits of quadratic differentials
- Parameter rays in the space of exponential maps
- Combinatorics of criniferous entire maps with escaping critical values
- A Classification of Postcritically Finite Newton Maps
- A combinatorial classification of postcritically fixed Newton maps
- Classification of escaping exponential maps
- Homotopy Hubbard trees for post-singularly finite exponential maps
- Iterated monodromy groups of exponential maps
- Classifying twisted exponentials
- Joining polynomial and exponential combinatorics for some entire maps
This page was built for publication: A combinatorial classification of postsingularly finite complex exponential maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953813)