A polycyclic quotient algorithm
From MaRDI portal
algorithms[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go Gr��bner bases]integral group ringspolycyclic groupsfinite presentationspolycyclic quotients
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Derived series, central series, and generalizations for groups (20F14) Group rings of infinite groups and their modules (group-theoretic aspects) (20C07) Software, source code, etc. for problems pertaining to group theory (20-04)
Recommendations
Cited in
(17)- Universal covers of finite groups
- Gröbner bases in function rings -- a guide for introducing reduction relations to algebraic structures
- A finite soluble quotient algorithm
- Orbit-stabilizer problems and computing normalizers for polycyclic groups.
- Computing stable epimorphisms onto finite groups
- On the Fitting subgroup of a polycyclic-by-finite group and its applications
- Computing polycyclic quotients of finitely (\(L\)-)presented groups via Groebner bases.
- On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
- On the Frattini subgroup of a polycyclic group
- An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators.
- Quotient tests and Gröbner bases.
- A sufficient condition for the second derived factor group to be finite
- Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
- A nilpotent quotient algorithm for finitely presented associative \(\mathbb{Z}\)-algebras and its application to integral group rings
- Efficient collection in infinite polycyclic groups.
- A practical algorithm for finding matrix representations for polycyclic groups
- Representing Subgroups of Finitely Presented Groups by Quotient Subgroups
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)
