Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1309.5219

Regular dessins with a given automorphism group

Gareth A. Jones
View original source ↗Read source document ↗Export metadata ↓

Abstract

Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are only finitely many regular dessins with automorphism group G. It is shown how to enumerate them, how to represent them all as quotients of a single regular dessin U(G), and how certain hypermap operations act on them. For example, if G is a cyclic group of order n then U(G) is a map on the Fermat curve of degree n and genus (n-1)(n-2)/2. On the other hand, if G=A_5 then U(G) has genus 274218830047232000000000000000001. For other non-abelian finite simple groups, the genus is much larger.

Explore related subjects

math.GRmath.AG

Keep this discovery

BibTeXRIS

Gareth A. Jones. 2013-09-20. Regular dessins with a given automorphism group. https://arxiv.org/abs/1309.5219

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗