Computing in the Monster

DOI10.1006/JSCO.1999.1008MaRDI QIDQ5928889zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Simon Norton

Publication date 12 July 2001

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1999.1008

zbMATH Keywords

computationsMonstersporadic simple groupssubgroups

Mathematics Subject Classification ID

Representations of sporadic groups (20C34) Simple groups: sporadic groups (20D08) Symbolic computation and algebraic computation (68W30)

Review text

The author speculates on various possible methods of computing in the Monster sporadic simple group. The huge size of this group makes this a hard problem, but it seems clear that any efficient system must make use of fast computation in one or more (large) subgroups. Explicit descriptions of several such subgroups are given, together with some results obtained by such computations. In the five years between submission and publication of this article, another practical method of computing in the Monster has been developed by the reviewer, with \textit{P. Walsh}, \textit{R. Parker} and \textit{S. Linton} [J. Group Theory 1, No. 4, 307-337 (1998; Zbl 0923.20011)] and is being used to answer several long-standing questions about this group.

Recommendations

• scientific article; zbMATH DE number 1981764
• Computer construction of the Monster
• A NEW COMPUTER CONSTRUCTION OF THE MONSTER USING 2-LOCAL SUBGROUPS
• New computations in the Monster.
• Conjugacy Class Representatives in the Monster Group

Cites work

• A New Uniqueness Proof for the Held Group
• A simple construction for the Fischer-Griess monster group
• Computer construction of the Monster
• scientific article; zbMATH DE number 4134298 (Why is no real title available?)
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 1284370 (Why is no real title available?)
• scientific article; zbMATH DE number 1284372 (Why is no real title available?)
• scientific article; zbMATH DE number 10424 (Why is no real title available?)
• scientific article; zbMATH DE number 278856 (Why is no real title available?)
• scientific article; zbMATH DE number 278858 (Why is no real title available?)
• Matrix generators for the Harada–Norton group
• Quilts and T-systems
• The friendly giant
• The Magma algebra system. I: The user language

Cited in

(10)

• New computations in the Monster.
• A presentation of the Monster and a set of matrices which satisfy it.
• scientific article; zbMATH DE number 91026 (Why is no real title available?)
• Computer construction of the Monster
• scientific article; zbMATH DE number 1981764 (Why is no real title available?)
• scientific article; zbMATH DE number 784873 (Why is no real title available?)
• scientific article; zbMATH DE number 874439 (Why is no real title available?)
• Heuristics for Cannon's algorithm with an application to Lyons sporadic group
• Conjugacy Class Representatives in the Monster Group
• A fast implementation of the Monster group. The Monster has been tamed

Describes a project that uses

Uses Software

• GAP
• Magma

This page was built for publication: Computing in the Monster

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928889)