Maximal subgroups of finite simple groups : classifications and applications
MetadataShow full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
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.
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
Surveys in Combinatorics 2021
Copyright © 2017, Cambridge University Press. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1017/9781009036214.010.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.