Working with finite groups

MaRDI QIDQ4238964zbMATH OpenFDO

Authors Hans Cuypers, Leonard H. Soicher, Hans Sterk

Publication date 20 April 1999

zbMATH Keywords

algorithmscomputational group theorygenerating permutationsgeneratorspresentationsrelationsTodd-Coxeter coset enumeration algorithm

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Symbolic computation and algebraic computation (68W30)

Review text

This chapter in the book `Some tapas of computer algebra' consists of an elementary exposition of two of the most important ideas of computational group theory, namely the Todd-Coxeter coset enumeration algorithm, and the Schreier-Sims base-and-strong-generating-set machinery. The latter is treated first, followed by a series of applications to algorithms for finding various types of subgroups of a group given by a set of generating permutations. This is followed by a description of the Todd-Coxeter algorithm and its use for finding generating permutations given a presentation of a group by generators and relations. For the entire collection see [Zbl 0924.13021].

Cited in

(4)

• Three-Dimensional Presentations for the Groups of Order at Most 30
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• scientific article; zbMATH DE number 784869 (Why is no real title available?)

This page was built for publication: Working with finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238964)