A polycyclic quotient algorithm

DOI10.1006/JSCO.1997.0167MaRDI QIDQ1382042zbMATH OpenOpenAlexFDO

Authors Eddie H. Lo

Publication date 15 February 1999

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

Full work available at URL https://semanticscholar.org/paper/9f0e5f8e9dd4f3acf81fe620f2c2866c4689d29b

zbMATH Keywords

algorithmsfinite presentationsGröbner basesintegral group ringspolycyclic groupspolycyclic quotients

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Group rings of infinite groups and their modules (group-theoretic aspects) (20C07) Generators, relations, and presentations of groups (20F05) Derived series, central series, and generalizations for groups (20F14) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1004936
• Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
• Computing polycyclic quotients of finitely (L-)presented groups via Groebner bases.
• Towards a soluble quotient algorithm

Cited in

(21)

• A generalization of Gröbner basis algorithms to polycyclic group rings
• Computing stable epimorphisms onto finite groups
• Orbit-stabilizer problems and computing normalizers for polycyclic groups.
• Efficient collection in infinite polycyclic groups.
• A finite soluble quotient algorithm
• A practical algorithm for finding matrix representations for polycyclic groups
• Universal covers of finite groups
• Gröbner bases in function rings -- a guide for introducing reduction relations to algebraic structures
• On the Frattini subgroup of a polycyclic group
• Representing Subgroups of Finitely Presented Groups by Quotient Subgroups
• scientific article; zbMATH DE number 996464 (Why is no real title available?)
• Quotient tests and Gröbner bases.
• A sufficient condition for the second derived factor group to be finite
• scientific article; zbMATH DE number 1004936 (Why is no real title available?)
• An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators.
• On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
• A nilpotent quotient algorithm for finitely presented associative \(\mathbb{Z}\)-algebras and its application to integral group rings
• Computing polycyclic quotients of finitely (L-)presented groups via Groebner bases.
• On the Fitting subgroup of a polycyclic-by-finite group and its applications
• Computational group theory: bedrock and new frontiers
• Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm

This page was built for publication: A polycyclic quotient algorithm

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