Computer construction of the Monster
From MaRDI portal
Recommendations
Cited in
(27)- A simple construction for the Fischer-Griess monster group
- Constructions of Fischer's Baby Monster over fields of characteristic not \(2\)
- A new maximal subgroup of the Monster
- On the construction of the finite simple groups with a given centralizer of a 2-central involution
- Explicit representations of maximal subgroups of the Monster.
- The Monster is a Hurwitz group
- The character table of a maximal subgroup of the Monster.
- scientific article; zbMATH DE number 3863454 (Why is no real title available?)
- A presentation of the Monster and a set of matrices which satisfy it.
- scientific article; zbMATH DE number 1981764 (Why is no real title available?)
- A NEW COMPUTER CONSTRUCTION OF THE MONSTER USING 2-LOCAL SUBGROUPS
- Conjugacy classes in sporadic simple groups
- Product Replacement in the Monster
- The Alperin Weight Conjecture and Uno's Conjecture for the Baby Monster B, p Odd
- scientific article; zbMATH DE number 878924 (Why is no real title available?)
- Maximal subgroups of sporadic groups
- scientific article; zbMATH DE number 278858 (Why is no real title available?)
- An Elementary Approach to the Monster
- Conjugacy Class Representatives in the Monster Group
- Computing in the Monster
- Monoidal categories, representation gap and cryptography
- A fast implementation of the Monster group. The Monster has been tamed
- Computational group theory. Abstracts from the workshop held June 1--6, 2025
- Computational group theory: bedrock and new frontiers
- The maximal subgroups of the monster
- Computing the character table of a 2-local maximal subgroup of the Monster
- On the multiplicity-free actions of the sporadic simple groups.
This page was built for publication: Computer construction of the Monster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221489)