A Combinatorial Classification of Postsingularly Finite Complex Exponential Maps
Bastian Laubner, Dierk Schleicher, Vlad Vicol
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 BFH to exponential maps. Our proof relies on the topological characterization of postsingularly finite exponential maps given recently in HSS. Our results illustrate once again the fruitful interplay between combinatorics, topology and complex structure which has often been successful in complex dynamics.
Create a lesson
Related papers
Physical and emergent nonpairwise interactions in oscillator networks: from higher-order phase reduction to coupling design
Riccardo Muolo, Hiroya Nakao, Christian Bick
Degree Growth of Iterates of Curves and Likely Intersections
Sina Saleh, Jit Wu Yap
Infinite prime sumsets in structured and Uk(Φ)-uniform sets
Felipe Hernández, Tristán Radić
Long-Lived Carpet-Like Transients in Time-Dependent Modular Discrete Laplacian Dynamics
Małgorzata Nowak-Kępczyk
SIPHy: Sparse identification of port-Hamiltonian systems from noisy data
Håkon Noren Myhr, Sølve Eidnes, J. Nathan Kutz
Extended dynamic mode decomposition with Fourier dictionaries: Error bounds and fast implementation
Felix Bartel, Sandra Ritter, Manuel Schaller et al.