Construction of defining relators for finite groups

DOI10.1016/0012-365X(73)90104-0zbMATH Open0272.20030MaRDI QIDQ759098FDOQ759098

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementation and Analysis of the Todd-Coxeter Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (19)

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

This page was built for publication: Construction of defining relators for finite groups

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