Finding intersections and normalizers in finitely generated nilpotent groups (Q1382041)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1136611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding intersections and normalizers in finitely generated nilpotent groups |
scientific article; zbMATH DE number 1136611 |
Statements
Finding intersections and normalizers in finitely generated nilpotent groups (English)
0 references
15 February 1999
0 references
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.
0 references
intersections of subgroups
0 references
normalizers
0 references
finitely generated nilpotent groups
0 references
nilpotent presentations
0 references
products of subgroups
0 references
conjugacy of subgroups
0 references
polycyclic groups
0 references
efficiency
0 references
algorithms
0 references
0.9278005
0 references
0.91876686
0 references
0.90438384
0 references
0.90160525
0 references
