Critically fixed Thurston maps: classification, recognition, and twisting

Read full text Summarise with VIRAT
Authors: Mikhail Hlushchanka, Nikolai Prochorov
Cited by: 0
References: 56

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Abstract An orientation‐preserving branched covering map is called a critically fixed Thurston map if fixes each of its critical points. It was recently shown that there is an explicit one‐to‐one correspondence between Möbius conjugacy classes of critically fixed rational maps and isomorphism classes of planar embedded connected graphs. In this paper, we generalize the result to the whole family of critically fixed Thurston maps. Namely, we show that each critically fixed Thurston map is obtained by applying the blow‐up operation , introduced by Kevin Pilgrim and Tan Lei, to a pair , where is a planar embedded graph in without isolated vertices and is an orientation‐preserving homeomorphism of that fixes each vertex of . This result allows us to provide a classification of combinatorial equivalence classes of critically fixed Thurston maps. We also develop an algorithm that reconstructs (up to isotopy) the pair associated with a critically fixed Thurston map . Finally, we solve some special instances of the Twisting Problem for the family of critically fixed Thurston maps obtained by blowing up pairs .

Fields of Study & Subjects

Mathematical Dynamics and Fractals Geometric and Algebraic Topology Advanced Differential Equations and Dynamical Systems

Publication details

Journal / source
Proceedings of the London Mathematical Society
Volume
132
Issue
3
Publication date
1 March 2026
Language
EN