Finding intersections and normalizers in finitely generated nilpotent groups

DOI10.1006/JSCO.1997.0166MaRDI QIDQ1382041zbMATH OpenOpenAlexFDO

Authors 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

algorithmsconjugacy of subgroupsefficiencyfinitely generated nilpotent groupsintersections of subgroupsnilpotent presentationsnormalizerspolycyclic groupsproducts of subgroups

Mathematics Subject Classification ID

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

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1166275
• On intersections of certain nilpotent subgroups in finite groups
• On the intersection of the normalizers of the nilpotent residuals of all subgroups of a finite group.
• scientific article; zbMATH DE number 6289556
• scientific article; zbMATH DE number 3893408
• scientific article; zbMATH DE number 3710417
• On the intersection of the normalizers of derived subgroups of all subgroups of a finite group.
• scientific article; zbMATH DE number 2099034
• Intersections of nilpotent subgroups in finite groups with sporadic socle
• On intersections of abelian and nilpotent subgroups in finite groups. I

Cited in

(17)

• Intersecting subgroups of finite soluble groups
• Some algorithms for nilpotent permutation groups
• Orbit-stabilizer problems and computing normalizers for polycyclic groups.
• Efficient collection in infinite polycyclic groups.
• A practical algorithm for finding matrix representations for polycyclic groups
• Algorithms for computing with nilpotent matrix groups over infinite domains.
• Decomposability of finitely generated torsion-free nilpotent groups
• Computing in Nilpotent Matrix Groups
• scientific article; zbMATH DE number 848088 (Why is no real title available?)
• Low-complexity computations for nilpotent subgroup problems
• Logspace and compressed-word computations in nilpotent groups
• scientific article; zbMATH DE number 6289556 (Why is no real title available?)
• Verifying nilpotence
• Post's correspondence problem: from computer science to algebra
• Post's Correspondence Problem for hyperbolic and virtually nilpotent groups
• The conjugacy problem and canonical representatives in finitely generated nilpotent groups
• Computing intersections and normalizers in soluble groups

Describes a project that uses

Uses Software

• Mathematica

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382041)