Search arXivSearch

arXiv · 1309.1968

An elementary approach to dessins d'enfants and the Grothendieck-Teichm\"uller group

Abstract

We give an account of the theory of dessins d'enfants which is both elementary and self-contained. We describe the equivalence of many categories (graphs embedded nicely on surfaces, finite sets with certain permutations, certain field extensions, and some classes of algebraic curves), some of which are naturally endowed with an action of the absolute Galois group of the rational field. We prove that the action is faithful. Eventually we prove that this absolute Galois group embeds into the Grothendieck-Teichm\"uller group $GT_0$ introduced by Drinfel'd. There are explicit approximations of $GT_0$ by finite groups, and we hope to encourage computations in this area. Our treatment includes a result which has not appeared in the literature yet: the Galois action on the subset of regular dessins - that is, those exhibiting maximal symmetry -- is also faithful.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre Guillot. 2013-09-08. An elementary approach to dessins d'enfants and the Grothendieck-Teichm\"uller group. https://arxiv.org/abs/1309.1968

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