On Coxeter's families of group presentations.

DOI10.1016/j.jalgebra.2010.02.043zbMath1204.20039OpenAlexW2050616850MaRDI QIDQ606655

George Havas, Derek F. Holt

Publication date: 18 November 2010

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2010.02.043

zbMATH Keywords

automatic groupspresentations of groupsfiniteness proofsinfiniteness proofsKnuth-Bendix rewritingTodd-Coxeter coset enumeration

Mathematics Subject Classification ID

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

Related Items

An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators. ⋮ Polynomial-time proofs that groups are hyperbolic

Uses Software

• GAP
• Magma
• AUTOMATA

Cites Work

• Computing with Abelian sections of finitely presented groups
• The Magma algebra system. I: The user language
• The groups \(G^{m,n,p}\).
• Minimal presentations for finite groups of prime-power order
• The Abstract Groups G m,n,p
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item