Rationality is decidable for nearly Euclidean Thurston maps

DOI10.1007/s10711-020-00593-9zbMath1473.57047arXiv1812.01066OpenAlexW3124933724MaRDI QIDQ2039284

Kevin M. Pilgrim, Walter R. Parry, William J. Floyd

Publication date: 2 July 2021

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.01066

zbMATH Keywords

rational mapThurston mapdecidable

Mathematics Subject Classification ID

Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Low-dimensional topology of special (e.g., branched) coverings (57M12) 2-dimensional topology (including mapping class groups of surfaces, Teichmüller theory, curve complexes, etc.) (57K20)

Related Items (3)

On the Pullback Relation on Curves Induced by a Thurston Map ⋮ The Pullback Map on Teichmüller Space Induced from a Thurston Map ⋮ Recognizing topological polynomials by lifting trees

Cites Work

• Unnamed Item
• Thurston's pullback map on the augmented Teichmüller space and applications
• Thurston equivalence of topological polynomials
• A proof of Thurston's topological characterization of rational functions
• Origami, affine maps, and complex dynamics
• Modular groups, Hurwitz classes and dynamic portraits of NET maps
• Pullback invariants of Thurston maps
• Nearly Euclidean Thurston maps
• On Thurston's pullback map
• Algorithmic aspects of branched coverings IV/V. Expanding maps
• Algorithmic aspects of branched coverings
• Presentations of NET maps
• Thurston equivalence to a rational map is decidable
• Canonical Thurston obstructions

This page was built for publication: Rationality is decidable for nearly Euclidean Thurston maps