Implementation and Analysis of the Todd-Coxeter Algorithm

DOI10.2307/2005654zbMATH Open0314.20028OpenAlexW4239081286MaRDI QIDQ4073550FDOQ4073550

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

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)

Cites Work

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

Cited In (32)

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

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

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