SearcharxivSearch

arXiv · 1907.07999

Non-Abelian Simple Groups Act with Almost All Signatures

Abstract

The topological data of a group action on a compact Riemann surface is often encoded using a tuple $(h;m_1,\dots ,m_s)$ called its signature. There are two easily verifiable arithmetic conditions on a tuple necessary for it to be a signature of some group action. In the following, we derive necessary and sufficient conditions on a group $G$ for when these arithmetic conditions are in fact sufficient to be a signature for all but finitely many tuples that satisfy them. As a consequence, we show that all non-Abelian finite simple groups exhibit this property.

Explore related subjects

Keep this discovery

BibTeXRIS

Mariela Carvacho, Jennifer Paulhus, Tom Tucker, Aaron Wootton. 2019-07-18. Non-Abelian Simple Groups Act with Almost All Signatures. https://arxiv.org/abs/1907.07999

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