Computing with Abelian sections of finitely presented groups
From MaRDI portal
Publication:1291087
Cites work
- scientific article; zbMATH DE number 475359 (Why is no real title available?)
- scientific article; zbMATH DE number 194815 (Why is no real title available?)
- scientific article; zbMATH DE number 848083 (Why is no real title available?)
- scientific article; zbMATH DE number 848088 (Why is no real title available?)
- scientific article; zbMATH DE number 923860 (Why is no real title available?)
- APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
- Computing automatic coset systems and subgroup presentations
- Construction of defining relators for finite groups
- Implementation and Analysis of the Todd-Coxeter Algorithm
- Peakword condensation and submodule lattices: An application of the Meat- Axe
- The Abstract Groups G m,n,p
- Towards a soluble quotient algorithm
Cited in
(9)- Universal covers of finite groups
- Computing S-unit groups of orders
- scientific article; zbMATH DE number 3871319 (Why is no real title available?)
- Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients
- scientific article; zbMATH DE number 475359 (Why is no real title available?)
- On Coxeter's families of group presentations.
- Computable abelian groups
- Computable torsion abelian groups
- Representing Subgroups of Finitely Presented Groups by Quotient Subgroups
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)