Computer construction of the Monster

DOI10.1515/jgth.1998.023zbMath0923.20011OpenAlexW2011789258MaRDI QIDQ4221489

Peter Gerard Walsh, Robert A. Wilson, Stephen 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

permutationsMonstersporadic simple groupsmatricesfaithful representationsmatrix representationscomputer constructions

Mathematics Subject Classification ID

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

Related Items (11)

A new maximal subgroup of the Monster ⋮ Product Replacement in the Monster ⋮ The Alperin Weight Conjecture and Uno's Conjecture for the Baby Monster B, _p Odd ⋮ Monoidal categories, representation gap and cryptography ⋮ Maximal subgroups of sporadic groups ⋮ Conjugacy Class Representatives in the Monster Group ⋮ Computing in the Monster ⋮ Explicit representations of maximal subgroups of the Monster. ⋮ The Character Table of a Maximal Subgroup of the Monster ⋮ Constructions of Fischer's Baby Monster over fields of characteristic not \(2\) ⋮ Conjugacy classes in sporadic simple groups

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computer construction of the Monster