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

DOI10.1017/S0004972700018529MaRDI QIDQ4515435zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• A Finitely Generated Infinite Simple Group
• A practical method for enumerating cosets of a finite abstract group
• An essay on free products of groups with amalgamations
• Implementation and Analysis of the Todd-Coxeter Algorithm

Cited in

(7)

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

Describes a project that uses

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)