A combinatorial classification of postsingularly finite complex exponential maps

Bastian Laubner, Dierk Schleicher, Vlad Vicol

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

We give a combinatorial classification of postsingularly finite exponential maps in terms of external addresses starting with the entry 0. This extends the classification results for critically preperiodic polynomials [2] to exponential maps. Our proof relies on the topological characterization of postsingularly finite exponential maps given recently in [14]. These results illustrate once again the fruitful interplay between combinatorics, topology and complex structure which has often been successful in complex dynamics.

Original languageEnglish (US)
Pages (from-to)663-682
Number of pages20
JournalDiscrete and Continuous Dynamical Systems
Volume22
Issue number3
DOIs
StatePublished - Nov 2008

All Science Journal Classification (ASJC) codes

  • Analysis
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Keywords

  • Classification
  • Exponential map
  • External address
  • Kneading sequence
  • Postsingularly finite
  • Spider

Fingerprint Dive into the research topics of 'A combinatorial classification of postsingularly finite complex exponential maps'. Together they form a unique fingerprint.

  • Cite this