Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1710.10434

Simple groups, generation and probabilistic methods

Timothy C. Burness
View original source ↗Read source document ↗Export metadata ↓

Abstract

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the extraordinary generation properties of simple groups, focussing on topics such as random generation, $(a,b)$-generation and spread, as well as highlighting the application of probabilistic methods in the proofs of many of the main results. We also present some recent work on the minimal generation of maximal and second maximal subgroups of simple groups, which has applications to the study of subgroup growth and the generation of primitive permutation groups.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Timothy C. Burness. 2017-10-28. Simple groups, generation and probabilistic methods. https://arxiv.org/abs/1710.10434

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↗