SearcharxivSearch

arXiv · 1407.3112

The Grothendieck-Teichm\"uller group of a finite group and $G$-dessins d'enfants

Abstract

For each finite group G, we define the Grothendieck-Teichm\"uller group of G, denoted GT(G), and explore its properties. The theory of dessins d'enfants shows that the inverse limit of GT(G) as G varies can be identified with a group defined by Drinfeld and containing the absolute Galois group of the rational field. We give in particular an identification of GT(G), in the case when G is simple and non-abelian, with a certain very explicit group of permutations that can be analyzed easily. With the help of a computer, we obtain precise information for G= PSL(2, q) when q= 4, 7, 8, 9, 11, 13, 16, 17, 19, and we treat A7, PSL(3, 3) and M11. In the rest of the paper we give a conceptual explanation for the technique which we use in our calculations. It turns out that the classical action of the Grothendieck-Teichm\"uller group on dessins d'enfants can be refined to an action on equivariant dessins, which we define, and this elucidates much of the first part.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre Guillot. 2014-07-11. The Grothendieck-Teichm\"uller group of a finite group and $G$-dessins d'enfants. https://arxiv.org/abs/1407.3112

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