A polycyclic quotient algorithm

DOI10.1006/jsco.1997.0167zbMath0930.20037OpenAlexW1988187114MaRDI QIDQ1382042

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

algorithmsGröbner basespolycyclic groupsintegral group ringsfinite presentationspolycyclic quotients

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Group rings of infinite groups and their modules (group-theoretic aspects) (20C07) 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 (8)

On the orbit-stabilizer problem for integral matrix actions of polycyclic groups ⋮ Universal covers of finite groups ⋮ Gröbner bases in function rings -- a guide for introducing reduction relations to algebraic structures ⋮ A practical algorithm for finding matrix representations for polycyclic groups ⋮ Computing stable epimorphisms onto finite groups ⋮ Representing Subgroups of Finitely Presented Groups by Quotient Subgroups ⋮ On the Fitting subgroup of a polycyclic-by-finite group and its applications ⋮ Orbit-stabilizer problems and computing normalizers for polycyclic groups.

This page was built for publication: A polycyclic quotient algorithm