A finite soluble quotient algorithm
From MaRDI portal
finite presentationspolycyclic presentationssoluble quotient algorithm\(p\)-quotient algorithm\(p\)-elementary Abelian normal subgroupsfinite soluble factor groupspolycyclic factor groupspolycyclic generating setspower conjugate presentations
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Derived series, central series, and generalizations for groups (20F14) Solvable groups, supersolvable groups (20F16) Software, source code, etc. for problems pertaining to group theory (20-04)
Abstract: An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.
Recommendations
Cited in
(14)- Computing subgroups by exhibition in finite solvable groups
- Universal covers of finite groups
- Computing double cosets in soluble groups
- scientific article; zbMATH DE number 665466 (Why is no real title available?)
- An algorithm to prove algebraic relations involving eta quotients
- Computing stable epimorphisms onto finite groups
- Computing polycyclic quotients of finitely (\(L\)-)presented groups via Groebner bases.
- Algorithms for finite soluble groups and applications
- Towards a soluble quotient algorithm
- Groups with exponent six
- An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators.
- scientific article; zbMATH DE number 3889792 (Why is no real title available?)
- scientific article; zbMATH DE number 5694287 (Why is no real title available?)
- Representing Subgroups of Finitely Presented Groups by Quotient Subgroups
This page was built for publication: A finite soluble quotient algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897565)
