Representing Subgroups of Finitely Presented Groups by Quotient Subgroups

DOI10.1080/10586458.2001.10504457zbMath1062.20037OpenAlexW2124685555MaRDI QIDQ2775765

Alexander Hulpke

Publication date: 2001

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1069786345

zbMATH Keywords

algorithmssubgroups of finitely presented groupssolvable normal subgroupsimages in quotient groups

Mathematics Subject Classification ID

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

Related Items (3)

Small partial Latin squares that embed in an infinite group but not into any finite group ⋮ Universal covers of finite groups ⋮ The perfect groups of order up to two million

Uses Software

• GAP
• QUOTPIC
• ATLAS Group Representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computer program for the calculation of a covering group of a finite group
• Towards a soluble quotient algorithm
• The algorithmic theory of polycyclic-by-finite groups
• The computation of normalizers in permutation groups
• Computing with group homomorphisms
• A polycyclic quotient algorithm
• A finite soluble quotient algorithm
• A computer application to finite p-groups
• A characterization of the Petersen-type geometry of the McLaughlin group
• Endliche Gruppen I
• A practical method for enumerating cosets of a finite abstract group

This page was built for publication: Representing Subgroups of Finitely Presented Groups by Quotient Subgroups