Publication:3950713
From MaRDI portal
zbMath0489.20003MaRDI QIDQ3950713
Publication date: 1982
defining relations; examples; introduction; computational group theory; Todd-Coxeter algorithm; coset enumeration; coset tables; low index subgroups; presentation of subgroups; Reidemeister- Schreier algorithm
20F05: Generators, relations, and presentations of groups
20-04: Software, source code, etc. for problems pertaining to group theory
Related Items
Scalable parallel coset enumeration: bulk definition and the memory wall, Constructing matrix representations of finitely presented groups, The Knuth-Bendix procedure for strings as a substitute for coset enumeration, Syntactic and Rees indices of subsemigroups, Recognizing badly presented \(Z\)-modules, On vector enumeration, Automorphism group computation and isomorphism testing in finite groups, Constructing a short defining set of relations for a finite group, An algorithmic approach to fundamental groups and covers of combinatorial cell complexes