A combinatorial classification of postsingularly finite complex exponential maps

From MaRDI portal



Abstract: We give a combinatorial classification of postsingularly finite exponential maps in terms of external addresses starting with the entry 0. This is an extension of the classification results for critically preperiodic polynomials cite{BFH} to exponential maps. Our proof relies on the topological characterization of postsingularly finite exponential maps given recently in cite{HSS}. Our results illustrate once again the fruitful interplay between combinatorics, topology and complex structure which has often been successful in complex dynamics.


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}}\)?











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)