A polycyclic quotient algorithm
algorithmsfinite presentationsGröbner basesintegral group ringspolycyclic groupspolycyclic quotients
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)
An algorithm to compute polycyclic quotients of a group given by a finite presentation is discussed. The algorithm is based on a generalization of the Gröbner basis method to the integral group ring of a polycyclic group. Most of this material can be found in the author's thesis (Rutgers Univ., 1996). A simplified version of this paper is also available [in DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 28, 159-167 (1997; Zbl 0874.20020)].
- 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)
