Probabilistic Generation of Finite Almost Simple Groups
Group Theory
2024-03-27 v1 Combinatorics
Abstract
We prove that if G is a sufficiently large finite almost simple group of Lie type, then given a fixed nontrivial element x in G and a coset of G modulo its socle, the probability that x and a random element of the coset generate a subgroup containing the socle is uniformly bounded away from 0 (and goes to 1 if the field size goes to infinity). This is new even if G is simple. Together with results of Lucchini and Burness--Guralnick--Harper, this proves a conjecture of Lucchini and has an application to profinite groups. A key step in the proof is the determination of the limits for the proportion of elements in a classical group which fix no subspace of any bounded dimension.
Cite
@article{arxiv.2403.17291,
title = {Probabilistic Generation of Finite Almost Simple Groups},
author = {Jason Fulman and Daniele Garzoni and Robert M. Guralnick},
journal= {arXiv preprint arXiv:2403.17291},
year = {2024}
}
Comments
26 pages