Computer construction of the Monster

DOI10.1515/JGTH.1998.023MaRDI QIDQ4221489zbMATH OpenOpenAlexFDO

Authors Peter Gerard Walsh, Robert A. Wilson, S. A. Linton, Richard A. Parker

Publication date 27 October 1999

Published in Journal of Group Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/jgth.1998.023

zbMATH Keywords

computer constructionsfaithful representationsmatricesmatrix representationsMonsterpermutationssporadic simple groups

Mathematics Subject Classification ID

Representations of sporadic groups (20C34) Simple groups: sporadic groups (20D08)

Review text

It was proved that the list of finite simple groups includes 26 simple groups, the so-called sporadic simple groups. Some of the above-mentioned groups were originally constructed by computer. The construction was in terms of permutations or matrices which generate the group. To carry out important calculations with these groups and answer questions about them having some kind of computer construction is necessary. For this purpose 25 of the 26 sporadic simple groups have computer constructions in terms of permutations or matrices except the so-called Monster whose order is the largest of the orders of the sporadic simple groups. The smallest degree of a faithful representation of the Monster over \(\text{GF}(2)\) is 196882 and working with matrices of this size needs a large storage place in a computer. However the authors, in this paper, describe a method which enables one to do some calculations in the Monster. In conclusion, the authors believe that their method of calculating in the Monster is correct although they can not prove it.

Recommendations

• scientific article; zbMATH DE number 1981764
• A NEW COMPUTER CONSTRUCTION OF THE MONSTER USING 2-LOCAL SUBGROUPS
• Computing in the Monster
• Conjugacy Class Representatives in the Monster Group

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.

Describes a project that uses

Uses Software

• GAP

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)