Computing with Abelian sections of finitely presented groups
DOI10.1006/JABR.1998.7713zbMATH Open0960.20018OpenAlexW1966377176MaRDI QIDQ1291087FDOQ1291087
Authors: 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
Recommendations
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)
Cites Work
- 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?)
- The Abstract Groups G m,n,p
- Peakword condensation and submodule lattices: An application of the Meat- Axe
- APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
- Construction of defining relators for finite groups
- Towards a soluble quotient algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing automatic coset systems and subgroup presentations
Cited In (9)
- Universal covers of finite groups
- Title not available (Why is that?)
- Computable abelian groups
- Computable torsion abelian groups
- Computing S-unit groups of orders
- Title not available (Why is that?)
- Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients
- On Coxeter's families of group presentations.
- Representing Subgroups of Finitely Presented Groups by Quotient Subgroups
Uses Software
This page was built for publication: Computing with Abelian sections of finitely presented groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291087)
