SearcharxivSearch

arXiv · 2103.10407

Explicit Constructions of Finite Groups as Monodromy Groups

Abstract

In 1963, Greenberg proved that every finite group appears as the monodromy group of some morphism of Riemann surfaces. In this paper, we give two constructive proofs of Greenberg's result. First, we utilize free groups, which given with the universal property and their construction as discrete subgroups of $\operatorname{PSL}_2(\mathbb{R})$, yield a very natural realization of finite groups as monodromy groups. We also give a proof of Greenberg's result based on triangle groups $\Delta(m, n, k)$. Given any finite group $G$, we make use of subgroups of $\Delta(m, n, k)$ in order to explicitly find a morphism $\pi$ such that $G \simeq \operatorname{Mon}(\pi)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ra-Zakee Muhammad, Javier Santiago, Eyob Tsegaye. 2021-03-18. Explicit Constructions of Finite Groups as Monodromy Groups. https://arxiv.org/abs/2103.10407

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