SearcharxivSearch

arXiv · 1802.03045

Algorithmic aspects of branched coverings III/V. Erasing maps, orbispaces, and the Birman exact sequence

Abstract

Let $\tilde f\colon(S^2,\tilde A)\to(S^2,\tilde A)$ be a Thurston map and let $M(\tilde f)$ be its mapping class biset: isotopy classes rel $\tilde A$ of maps obtained by pre- and post-composing $\tilde f$ by the mapping class group of $(S^2,\tilde A)$. Let $A\subseteq\tilde A$ be an $\tilde f$-invariant subset, and let $f\colon(S^2,A)\to(S^2,A)$ be the induced map. We give an analogue of the Birman short exact sequence: just as the mapping class group $\mathrm{Mod}(S^2,\tilde A)$ is an iterated extension of $\mathrm{Mod}(S^2,A)$ by fundamental groups of punctured spheres, $M(\tilde f)$ is an iterated extension of $M(f)$ by the dynamical biset of $f$. Thurston equivalence of Thurston maps classically reduces to a conjugacy problem in mapping class bisets. Our short exact sequence of mapping class bisets allows us to reduce in polynomial time the conjugacy problem in $M(\tilde f)$ to that in $M(f)$. In case $\tilde f$ is geometric (either expanding or doubly covered by a hyperbolic torus endomorphism) we show that the dynamical biset $B(f)$ together with a "portrait of bisets" induced by $\tilde A$ is a complete conjugacy invariant of $\tilde f$. Along the way, we give a complete description of bisets of $(2,2,2,2)$-maps as a crossed product of bisets of torus endomorphisms by the cyclic group of order $2$, and we show that non-cyclic orbisphere bisets have no automorphism. We finally give explicit, efficient algorithms that solve the conjugacy and centralizer problems for bisets of expanding or torus maps.

Explore related subjects

Keep this discovery

BibTeXRIS

Laurent Bartholdi, Dzmitry Dudko. 2018-02-08. Algorithmic aspects of branched coverings III/V. Erasing maps, orbispaces, and the Birman exact sequence. https://arxiv.org/abs/1802.03045

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