Critically fixed Thurston maps: classification, recognition, and twisting
Abstract
An orientation-preserving branched covering map f S2 S2 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\"obius 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,), where G is a planar embedded graph in S2 without isolated vertices and is an orientation-preserving homeomorphism of S2 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,) 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, idS2).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.