Critically fixed Thurston maps: classification, recognition, and twisting
Mikhail Hlushchanka, Nikolai Prochorov
TL;DR
The paper addresses classification, recognition, and twisting for critically fixed Thurston maps on $S^2$ by encoding each map as a blow-up of a planar embedded graph pair $(G,\varphi)$. It proves a canonical bijection between admissible pairs and combinatorial classes of critically fixed Thurston maps, and introduces the charge graph $ ext{Charge}(f)$ together with a lifting algorithm that recovers the model from a map. A global pullback contraction for admissible trees under a given $f$ yields a finite attractor $\,\mathcal{N}_f$, enabling a constructive recognition method and obstruction analysis. The twisting problem is solved in special cases by a graph-rotation operation, linking Dehn twists to combinatorial twists of the model graph and showing periodicity with period dividing $|G\cap \gamma|$. These results unify Thurston theory with graph-based combinatorics, offering algorithmic tools and deepening connections to decomposition theory and Sullivan’s dictionary.
Abstract
An orientation-preserving branched covering map $f\colon S^2 \to S^2$ is called a critically fixed Thurston map if $f$ 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 the paper, we generalize this result to the whole family of critically fixed Thurston maps. Namely, we show that each critically fixed Thurston map $f$ is obtained by applying the blow-up operation, introduced by Kevin Pilgrim and Tan Lei, to a pair $(G,\varphi)$, where $G$ is a planar embedded graph in $S^2$ without isolated vertices and $\varphi$ is an orientation-preserving homeomorphism of $S^2$ that fixes each vertex of $G$. 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 $(G,\varphi)$ associated with a critically fixed Thurston map $f$. Finally, we solve some special instances of the twisting problem for the family of critically fixed Thurston maps obtained by blowing up pairs $(G, \mathrm{id}_{S^2})$.
