Generation and random generation: From simple groups to maximal subgroups

Tim C Burness, Martin W Liebeck, Aner Shalev

Research output: Contribution to journalArticle (Academic Journal)peer-review

6 Citations (Scopus)

Abstract

Let G be a finite group and let d(G) be the minimal number of generators
for G. It is well known that d(G) = 2 for all (non-abelian) finite simple groups. We
prove that d(H) 4 for any maximal subgroup H of a finite simple group, and that this bound is best possible.
We also investigate the random generation of maximal subgroups of simple and almost simple groups. By applying a recent theorem of Jaikin-Zapirain and Pyber we show that the expected number of random elements generating such a subgroup is bounded by an absolute constant.
We then apply our results to the study of permutation groups. In particular we
show that if G is a finite primitive permutation group with point stabilizer H, then
d(H) is at most d(G) + 4.
Original languageEnglish
Pages (from-to)59-95
Number of pages37
JournalAdvances in Mathematics
Volume248
DOIs
Publication statusPublished - 25 Nov 2013

Fingerprint Dive into the research topics of 'Generation and random generation: From simple groups to maximal subgroups'. Together they form a unique fingerprint.

Cite this