Search arXivSearch

arXiv · 2011.05660

A Class of Efficient Presentations of Finite Simple Groups

Abstract

We exhibit a new presentation of the (equilateral) Von Dyck groups $D(2,3,n), \ n\ge 3$, in terms of two generators of order $n$ satisfying three relations, one of which is Artin's braid relation. By dropping the relation which fixes the order of the generators we obtain the universal covering groups of the corresponding Von Dyck groups. In the cases $n=3,\, 4,\,5$, these are respectively the double covers of the finite rotational tetrahedral, octahedral and icosahedral groups. When $n\ge 6$ we obtain infinite covers of the corresponding infinite Von Dyck groups. The interesting cases arise for $n\ge 7$ when these groups act as discrete groups of isometries of the hyperbolic plane. Imposing a suitable third relation we obtain a host of (efficient) presentations of finite simple Chevalley groups of type $A_1$ as well as the sporadic Janko group $J_2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Orlin Stoytchev. 2020-11-11. A Class of Efficient Presentations of Finite Simple Groups. https://arxiv.org/abs/2011.05660

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