Maximal subgroups of finite simple groups : classifications and applications
Abstract
This paper surveys what is currently known about the maximal subgroups of the finite simple groups. After briefly introducing the groups themselves, if their maximal subgroups are completely determined then we present this classification. For the remaining finite simple groups our current knowledge is only partial: we describe the state of play, as well as giving some results that apply more generally. We also direct the reader towards computational resources for the construction of maximal subgroups. After this, we present three sample applications, selected because they combine group theoretical and combinatorial arguments, and because they use either or both of the detailed classifications and the looser statements that can be made about all maximal subgroups. In particu- lar, we discuss results relating to generation, and the generating graph; results concerning bases; and some applications to computational com- plexity, in particular to graph colouring and other problems with no known polynomial-time solution.
Citation
Roney-Dougal , C M 2021 , Maximal subgroups of finite simple groups : classifications and applications . in K K Dabrowski , M Gadouleau , N Georgiou , M Johnson , G B Mertzios & D Paulusma (eds) , Surveys in Combinatorics 2021 . London Mathematical Society Lecture Note Series , vol. 470 , Cambridge University Press , pp. 343-370 . https://doi.org/10.1017/9781009036214.010
Publication
Surveys in Combinatorics 2021
ISSN
0076-0552Type
Conference item
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.