Working with finite groups (Q4238964)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1276819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Working with finite groups |
scientific article; zbMATH DE number 1276819 |
Statements
20 April 1999
0 references
computational group theory
0 references
Todd-Coxeter coset enumeration algorithm
0 references
algorithms
0 references
generating permutations
0 references
presentations
0 references
generators
0 references
relations
0 references
Working with finite groups (English)
0 references
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].
0 references
