Standard generators for sporadic simple groups
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.
reproducibility of computational results on sporadic groups
scientific article; zbMATH DE number 930153