Computing in the Monster
From MaRDI portal
Recommendations
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
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)