Proving a group trivial made easy: A case study in coset enumeration

DOI10.1017/S0004972700018529zbMATH Open0985.20019OpenAlexW2152353007MaRDI QIDQ4515435FDOQ4515435

Authors: George Havas, Colin M. Ramsay 

Publication date: 6 May 2002

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700018529

Recommendations

• scientific article; zbMATH DE number 1273662
• scientific article; zbMATH DE number 2070158
• Irreducible Cyclic Presentations of the Trivial Group
• Cyclic Presentations of the Trivial Group
• Double coset enumeration

zbMATH Keywords

presentationscoset enumerationTodd-Coxeter process

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

• A Finitely Generated Infinite Simple Group
• An essay on free products of groups with amalgamations
• Title not available (Why is that?)
• Implementation and Analysis of the Todd-Coxeter Algorithm
• A practical method for enumerating cosets of a finite abstract group

Cited In (7)

• Coset enumeration for certain infinitely presented groups.
• Irreducible Cyclic Presentations of the Trivial Group
• Nice Efficient Presentions for all Small Simple Groups and their Covers
• An enumeration process for racks
• Three-Dimensional Presentations for the Groups of Order at Most 30
• On the Efficiency of Some Finite Groups
• Locally toroidal polytopes of rank 6 and sporadic groups

Uses Software

• STAR/MPI

This page was built for publication: Proving a group trivial made easy: A case study in coset enumeration

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