Construction of defining relators for finite groups

DOI10.1016/0012-365X(73)90104-0zbMath0272.20030MaRDI QIDQ759098

John J. Cannon

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Abstract finite groups (20D99)

Related Items

Two Short Presentations for Lyons' Sporadic Simple Group, Efficient presentations for three simple groups, Computing group resolutions., Local symmetry groups for arbitrary wavevectors, Pseudo-deterministic Proofs, A practical model for computation with matrix groups., A strong generating test and short presentations for permutation groups, New methods for using Cayley graphs in interconnection networks, Computing the subgroups of a permutation group, The non-abelian simple groups g, |g| < 10⁵— presentations, On presentations for unitary groups, Some 3-Generator, 3-Relation Finite 2-Groups, Computing with groups and their character tables, Presentations for some direct products of groups, The complete Phan-type theorem for Sp(2n,q), Computing with Abelian sections of finitely presented groups, Constructing a short defining set of relations for a finite group, Effective computation with group homomorphisms

Cites Work

• Implementation and Analysis of the Todd-Coxeter Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item