The maximal subgroups of the Monster
Abstract
The classification of the maximal subgroups of the Monster is a long-standing problem in finite group theory. According to the literature, the classification is complete apart from the question of whether contains maximal subgroups that are almost simple with socle . However, this conclusion relies on reported claims, with unpublished proofs, that has no maximal subgroups that are almost simple with socle , , or . The aim of this paper is to settle all of these questions, and thereby complete the solution to the maximal subgroup problem for , and for the sporadic simple groups as a whole. Specifically, we prove the existence of two new maximal subgroups of , isomorphic to the automorphism groups of and , and we establish that has no almost simple maximal subgroup with socle or . We also correct the claim that has no almost simple maximal subgroup with socle , and provide evidence that the maximal subgroup (constructed in 2004) does not exist. Our proofs are supported by reproducible computations carried out using the publicly available Python package mmgroup for computing with recently developed by M. Seysen. We provide explicit generators for our newly discovered maximal subgroups of in mmgroup format.
Cite
@article{arxiv.2304.14646,
title = {The maximal subgroups of the Monster},
author = {Heiko Dietrich and Melissa Lee and Tomasz Popiel},
journal= {arXiv preprint arXiv:2304.14646},
year = {2025}
}
Comments
This is the accepted version of the paper. Note that v3-v5 absorb arXiv:2310.03317