Representing Subgroups of Finitely Presented Groups by Quotient Subgroups

DOI10.1080/10586458.2001.10504457MaRDI QIDQ2775765zbMATH OpenOpenAlexFDO

Authors A. Hulpke

Publication date 2001

Published in Experimental Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.em/1069786345, https://eudml.org/doc/51273

zbMATH Keywords

algorithmssubgroups of finitely presented groupssolvable normal subgroupsimages in quotient groups

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 665466
• Computing with Abelian sections of finitely presented groups
• Towards a soluble quotient algorithm
• An L₂-quotient algorithm for finitely presented groups.
• Algorithms for polycyclic-by-finite groups

Cites work

• scientific article; zbMATH DE number 1262425 (Why is no real title available?)
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• scientific article; zbMATH DE number 947812 (Why is no real title available?)
• scientific article; zbMATH DE number 3452100 (Why is no real title available?)
• scientific article; zbMATH DE number 775176 (Why is no real title available?)
• scientific article; zbMATH DE number 3224578 (Why is no real title available?)
• A characterization of the Petersen-type geometry of the McLaughlin group
• A computer application to finite p-groups
• A computer program for the calculation of a covering group of a finite group
• A finite soluble quotient algorithm
• A polycyclic quotient algorithm
• A practical method for enumerating cosets of a finite abstract group
• Computing with group homomorphisms
• Endliche Gruppen I
• The algorithmic theory of polycyclic-by-finite groups
• The computation of normalizers in permutation groups
• Towards a soluble quotient algorithm

Cited in

(7)

• Universal covers of finite groups
• scientific article; zbMATH DE number 5953646 (Why is no real title available?)
• scientific article; zbMATH DE number 665466 (Why is no real title available?)
• The perfect groups of order up to two million
• An L₂-quotient algorithm for finitely presented groups.
• Quotient tests and Gröbner bases.
• Small partial Latin squares that embed in an infinite group but not into any finite group

Describes a project that uses

Uses Software

• ATLAS Group Representations
• QUOTPIC
• GAP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2775765)