On the construction of the finite simple groups with a given centralizer of a 2-central involution
The author gives a survey of his programme to construct all the sporadic simple groups in a `uniform' way. It is not entirely uniform, and does not work in all cases, but appears to be designed to plug in to the proof of the classification theorem for finite simple groups. The computations are necessarily hard, as he deliberately avoids using any of the many clever tricks and arguments used in the original constructions. Striving for uniformity has the unfortunate side-effect that the calculations can only be performed by custom-built programs running on massively-parallel machines. The method is to start with an involution centralizer, and to construct a suitable amalgamation of this group with a fours-group normalizer, using the methods developed by Norton, Parker et al. in Cambridge in the 1970s. From this, a permutation representation is made by permuting an orbit of vectors, and the methods of Sims are used to deduce the required properties of the group. Eventually, one has an existence proof for the group in question.
scientific article; zbMATH DE number 1565882