Implementation and Analysis of the Todd-Coxeter Algorithm

DOI10.2307/2005654zbMath0314.20028OpenAlexW4239081286MaRDI QIDQ4073550

Jane M. Watson, George Havas, John J. Cannon, Lucien A. Dimino

Publication date: 1973

Full work available at URL: https://doi.org/10.2307/2005654

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (30)

A catalogue of complete group presentations ⋮ On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations ⋮ Applications and adaptations of the low index subgroups procedure ⋮ On semigroup presentations ⋮ Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach ⋮ Computing in permutation and matrix groups. III: Sylow subgroups ⋮ Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups. ⋮ Local symmetry groups for arbitrary wavevectors ⋮ A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model ⋮ On doing Todd-Coxeter coset enumeration in parallel ⋮ A note on the Todd-Coxeter coset enumeration algorithm ⋮ Computer aided determination of a Fibonacci group ⋮ Double coset enumeration ⋮ Constructing matrix representations of finitely presented groups ⋮ Scalable parallel coset enumeration: bulk definition and the memory wall ⋮ Computing the ideal structure of finite semigroups ⋮ Use of computers in solving well-known algebra problems ⋮ Verifying nilpotence ⋮ Computers in semigroups ⋮ Transformationendarstellungen endlicher abstrakt präsentierter Halbgruppen ⋮ Computing with groups and their character tables ⋮ Groups of exponent eight ⋮ Construction of defining relators for finite groups ⋮ Computing with Abelian sections of finitely presented groups ⋮ A census of regular 3-polystroma arising from honeycombs ⋮ Constructing a short defining set of relations for a finite group ⋮ Effective computation with group homomorphisms ⋮ A family of Hurwitz groups with non-trivial centres ⋮ Computational approaches to combinatorial group theory ⋮ Proving a group trivial made easy: A case study in coset enumeration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programmierung der Restklassenabzählung einer Gruppe nach Untergruppen
• The multipliers of the simple groups of order 604,800 and 50, 232,960
• Note on a conjecture of Coxeter
• On a Class of Finitely Presented Groups
• Some Remarks on the Mathieu Groups
• A Machine Program for Coset Enumeration
• On Janko's Simple Group of Order 50,232,960
• A Set of Generators and Relations for the Group PSL(2, Q ), q Odd
• An Algorithmic Solution for a Word Problem in Group Theory
• A practical method for enumerating cosets of a finite abstract group
• The Abstract Groups G m,n,p

This page was built for publication: Implementation and Analysis of the Todd-Coxeter Algorithm