A finite soluble quotient algorithm

DOI10.1006/jsco.1994.1064zbMath0844.20002arXiv1801.09268OpenAlexW2082899545MaRDI QIDQ1897565

Alice C. Niemeyer

Publication date: 21 July 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.09268

zbMATH Keywords

polycyclic presentationsfinite presentationssoluble quotient algorithm\(p\)-quotient algorithm\(p\)-elementary Abelian normal subgroupsfinite soluble factor groupspolycyclic factor groupspolycyclic generating setspower conjugate presentations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Derived series, central series, and generalizations for groups (20F14)

Related Items (6)

Groups with exponent six ⋮ Universal covers of finite groups ⋮ Computing stable epimorphisms onto finite groups ⋮ Computing double cosets in soluble groups ⋮ Representing Subgroups of Finitely Presented Groups by Quotient Subgroups ⋮ Computing subgroups by exhibition in finite solvable groups

Uses Software

• GAP
• EDDIE

This page was built for publication: A finite soluble quotient algorithm