SearcharxivSearch

arXiv · 2401.06870

GT-shadows for the gentle version of the Grothendieck-Teichmueller group

Abstract

Let $B_3$ be the Artin braid group on 3 strands and $PB_3$ be the corresponding pure braid group. In this paper, we construct the groupoid $GTSh$ of GT-shadows for a (possibly more tractable) version $GT_0$ of the Grothendieck-Teichmueller group $GT$ introduced by D. Harbater and L. Schneps in 2000. We call this group the gentle version of $GT$ and denote it by $GT_{gen}$. The objects of $GTSh$ are finite index normal subgroups $N$ of $B_3$ satisfying the condition $N \subset PB_3$. Morphisms of $GTSh$ are called GT-shadows and they may be thought of as approximations to elements of $GT_{gen}$. We show how GT-shadows can be obtained from elements of $GT_{gen}$ and prove that $GT_{gen}$ is isomorphic to the limit of a certain functor defined in terms of the groupoid $GTSh$. Using this result, we get a criterion for identifying genuine GT-shadows.

Explore related subjects

Keep this discovery

BibTeXRIS

Vasily A. Dolgushev, Jacob J. Guynee. 2024-01-12. GT-shadows for the gentle version of the Grothendieck-Teichmueller group. https://arxiv.org/abs/2401.06870

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