Search arXivSearch

arXiv · 1603.04059

Algorithmic aspects of branched coverings II/V. Sphere bisets and their decompositions

Abstract

We consider "Thurston maps": branched self-coverings of the sphere with ultimately periodic critical points, and prove that the Thurston equivalence problem between them (continuous deformation of maps along with their critical orbits) is decidable. More precisely, we consider the action of mapping class groups, by pre- and post-composition, on branched coverings, and encode them algebraically as "mapping class bisets". We show how the mapping class biset of maps preserving a multicurve decomposes into mapping class bisets of smaller complexity, called "small mapping class bisets". We phrase the decision problem of Thurston equivalence between branched self-coverings of the sphere in terms of the conjugacy and centralizer problems in a mapping class biset. Our decomposition results on mapping class bisets reduce these decision problems to small mapping class bisets; they correspond to rational maps, homeomorphisms and maps double covered by a torus endomorphism, and their conjugacy and centralizer problems are solvable respectively in terms of complex analysis, group theory and linear algebra. Branched coverings themselves are also encoded into bisets, with actions of the fundamental groups. We characterize those bisets that arise from branched coverings between topological spheres, and extend this correspondence to maps between spheres with multicurves, whose algebraic counterparts are "sphere trees of bisets". To illustrate the difference between Thurston maps and homeomorphisms, we produce a Thurston map with infinitely generated centralizer --- while centralizers of homeomorphisms are always finitely generated.

Explore related subjects

Keep this discovery

BibTeXRIS

Laurent Bartholdi, Dzmitry Dudko. 2016-03-13. Algorithmic aspects of branched coverings II/V. Sphere bisets and their decompositions. https://arxiv.org/abs/1603.04059

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR