Explicit construction of the maximal subgroups of the Monster
Group Theory
2024-11-20 v1
Abstract
Seysen's Python package mmgroup provides functionality for fast computations within the sporadic simple group , the Monster. The aim of this work is to present an mmgroup database of maximal subgroups of : for each conjugacy class of maximal subgroups in , we construct explicit group elements in mmgroup and prove that these elements generate a group in . Our generators and the computations verifying correctness are available in accompanying code. The maximal subgroups of have been classified in a number of papers spanning several decades; our work constitutes an independent verification of these constructions. We also correct the claim that has a maximal subgroup , and hence identify a new maximal subgroup .
Keywords
Cite
@article{arxiv.2411.12230,
title = {Explicit construction of the maximal subgroups of the Monster},
author = {Heiko Dietrich and Melissa Lee and Anthony Pisani and Tomasz Popiel},
journal= {arXiv preprint arXiv:2411.12230},
year = {2024}
}
Comments
22 pages