Finding intersections and normalizers in finitely generated nilpotent groups
Practical algorithms to compute intersections and normalizers of subgroups in finitely generated nilpotent groups from nilpotent presentations are developed. These ideas are extended to give practical algorithms to determine membership in products of subgroups and to determine conjugacy of subgroups. A test for nilpotency is also described for polycyclic groups. A prototype Mathematica program has been written to test the efficiency of some of the algorithms described here. The results are tabulated in the last section.
scientific article; zbMATH DE number 1136611