Indeed, the Monster has no almost simple maximal subgroup with socle $\text{PSL}_2(16)$
Heiko Dietrich, Melissa Lee, Tomasz Popiel

TL;DR
This paper proves that the Monster group has no maximal subgroups that are almost simple with socle isomorphic to PSL_2(16), supporting a broader classification conjecture about the group's maximal subgroups.
Contribution
The paper provides a proof that the Monster group lacks almost simple maximal subgroups with socle PSL_2(16), using computational methods, advancing the classification of its maximal subgroups.
Findings
No almost simple maximal subgroup with socle PSL_2(16) in the Monster group.
Supports broader conjecture on the classification of Monster's maximal subgroups.
Utilizes computational tools for group theory verification.
Abstract
The classification of the maximal subgroups of the Monster is believed to be complete subject to an unpublished result of Holmes and Wilson asserting that has no maximal subgroups that are almost simple with socle isomorphic to , , or . We prove this result for , with the intention that the other two cases will be dealt with in an expanded version of this paper. Our proof is supported by reproducible computations carried out using Seysen's publicly available Python package mmgroup for computing with .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Chronic Lymphocytic Leukemia Research · Limits and Structures in Graph Theory
