Implementation and Analysis of the Todd-Coxeter Algorithm

DOI10.2307/2005654MaRDI QIDQ4073550zbMATH OpenOpenAlexFDO

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

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

Cites work

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

Cited in

(33)

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

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)