Explicit construction of the maximal subgroups of the Monster (Q6858735)

The Monster group \(\mathbb{M}\) is the largest sporadic finite simple group. The maximal subgroups of \(\mathbb{M}\) have been classified in a number of papers spanning several decades, see [\textit{H. Dietrich} et al., Adv. Math. 469, Article ID 110214, 33 p. (2025; Zbl 1567.20042)]. The first result of the present paper is the following: \(\mathbb{M}\) has no subgroup \(PSL_2(59)\), but a unique class of subgroups \(59:29\), which are maximal subgroups. This result is in conflict with the main result of \textit{P. E. Holmes} and \textit{R. A. Wilson} [J. Lond. Math. Soc., II. Ser. 69, No. 1, 141--152 (2004; Zbl 1064.20017)] which claims that \(\mathbb{M}\) has a maximal subgroup \(PSL_2(59)\). Seysen's Python mmgroup software package (see \url{https://github.com/Martin-Seysen/mmgroup}) provides functionality for fast computations within \(\mathbb{M}\). The main aim of this paper is to present an mmgroup database of maximal subgroups of \(\mathbb{M}\): for each conjugacy class \(C\) of maximal subgroups in \(\mathbb{M}\), the authors construct explicit group elements in mmgroup format and prove that these elements generate a group in \(C\). The work constitutes an independent verification of the constructions of maximal subgroups in \(\mathbb{M}\).