scientific article
From MaRDI portal
Publication:3950713
zbMath0489.20003MaRDI QIDQ3950713
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
defining relationsexamplesintroductioncomputational group theoryTodd-Coxeter algorithmcoset enumerationcoset tableslow index subgroupspresentation of subgroupsReidemeister- Schreier algorithm
Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items (19)
Freeness and 𝑆-arithmeticity of rational Möbius groups ⋮ Computing maximal subgroups of finite groups. ⋮ Computing group resolutions. ⋮ Obituary: Joachim Neubüser (1932--2021) ⋮ Systolic length of triangular modular curves ⋮ Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups. ⋮ Automorphism group computation and isomorphism testing in finite groups ⋮ A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model ⋮ An algorithmic approach to fundamental groups and covers of combinatorial cell complexes ⋮ Constructing matrix representations of finitely presented groups ⋮ The Knuth-Bendix procedure for strings as a substitute for coset enumeration ⋮ Scalable parallel coset enumeration: bulk definition and the memory wall ⋮ Verifying nilpotence ⋮ Syntactic and Rees indices of subsemigroups ⋮ Constructing a short defining set of relations for a finite group ⋮ A computer program for the calculation of a covering group of a finite group ⋮ Recognizing badly presented \(Z\)-modules ⋮ On vector enumeration ⋮ Effective computation with group homomorphisms
This page was built for publication:
