Standard generators for sporadic simple groups
type: Item
instance of: scholarly article
title: Standard generators for sporadic simple groups
zbMATH Open document ID: 0855.20034
published in: Journal of Algebra
publication date: 1996-11-03T00:00:00Z
review text: Many results about sporadic simple groups are obtained by computer calculations. A common problem is to check and reproduce such results. The aim of the paper under review is to improve the reproducibility of computational results on sporadic groups. The author concentrates on the following problem: Find for a simple sporadic group \(G\) a set of generators \(\{g_1,\dots,g_r\}\), such that if one knows that one has another generation \(G=\langle h_1,\dots,h_s\rangle\), one can find in an easy way an explicit automorphism \(\phi\), such that \(\phi(g_i)=w_i(h_1,\dots,h_s)\) for suitable words \(w_i\) in the \(h_j\)'s. For all 26 sporadic groups the author gives a so called set of standard generators of two elements. He discusses, why these pairs are a suitable choice with respect to the above problem.
Mathematics Subject Classification ID: 20F05
Mathematics Subject Classification ID: 20D08
Mathematics Subject Classification ID: 20-04
zbMATH DE Number: 930153
zbMATH Keywords: sporadic simple groups
zbMATH Keywords: computer calculations
zbMATH Keywords: reproducibility of computational results on sporadic groups
zbMATH Keywords: generators
zbMATH Keywords: explicit automorphisms
zbMATH Keywords: words
zbMATH Keywords: sets of standard generators
author: Robert A. Wilson
reviewed by: Ulrich Dempwolff
MaRDI profile type: Publication
full work available at URL: jabr.1996.0271
OpenAlex ID: W2010987003
Wikidata QID: Q61012341
DOI: 10.1006/JABR.1996.0271
description: scientific article; zbMATH DE number 930153