This paper describes the computer construction of the largest of the 26 sporadic simple groups, the so-called Monster, which is described in detail in this paper.Expand

We design an algorithm to find certain partial permutation representations of a finitely presented group $G$ (the bricks) that may be combined to a transitive permutation representation of $G$ (the… Expand

The Lyons simple group was first constructed by Sims [5] as a permutation group on 8835156 points. This representation is, because of its size, not very useful for calculating in the group. In this… Expand

This book describes some computational methods to deal with modular characters of finite groups. It is the theoretical background of the MOC system of the same authors. This system was, and is still… Expand

By computer search we show that the lattice Γ from [9] is the unique extremal even unimodular 72-dimensional lattices that can be constructed as proposed in [6].

In the present paper we determine the 5-modular decomposition matrices for the sporadic group 3.G - 3McL, the triple cover of the McLaughlin group. There are only blocks of defect 0 and blocks of… Expand