Computing with Abelian sections of finitely presented groups

DOI10.1006/jabr.1998.7713zbMath0960.20018OpenAlexW1966377176MaRDI QIDQ1291087

Sarah Rees, Derek F. Holt

Publication date: 7 February 2001

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

Full work available at URL: https://semanticscholar.org/paper/6d0c120b6dd4fa6e6fd91f385c149e0dd320f243

zbMATH Keywords

algorithmssoftware packagesfinitely presented groupsAbelian-by-finite quotients

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 (2)

On Coxeter's families of group presentations. ⋮ Universal covers of finite groups

Uses Software

• GAP
• Magma
• MeatAxe
• QUOTPIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of defining relators for finite groups
• Towards a soluble quotient algorithm
• Computing automatic coset systems and subgroup presentations
• Peakword condensation and submodule lattices: An application of the Meat- Axe
• Implementation and Analysis of the Todd-Coxeter Algorithm
• APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
• The Abstract Groups G m,n,p

This page was built for publication: Computing with Abelian sections of finitely presented groups