Finding intersections and normalizers in finitely generated nilpotent groups

DOI10.1006/jsco.1997.0166zbMath0930.20038OpenAlexW2056211288MaRDI QIDQ1382041

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://doi.org/10.1006/jsco.1997.0166

zbMATH Keywords

algorithmsefficiencynormalizersproducts of subgroupspolycyclic groupsfinitely generated nilpotent groupsintersections of subgroupsconjugacy of subgroupsnilpotent presentations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Nilpotent groups (20F18) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (7)

Post's correspondence problem: from computer science to algebra ⋮ Post's Correspondence Problem for hyperbolic and virtually nilpotent groups ⋮ A practical algorithm for finding matrix representations for polycyclic groups ⋮ Algorithms for computing with nilpotent matrix groups over infinite domains. ⋮ Computing in Nilpotent Matrix Groups ⋮ Orbit-stabilizer problems and computing normalizers for polycyclic groups. ⋮ Efficient collection in infinite polycyclic groups.

Uses Software

• Mathematica

This page was built for publication: Finding intersections and normalizers in finitely generated nilpotent groups