๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finitely generated nilpotent hc groups are free abelian

โœ Scribed by Mathew Timm

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
429 KB
Volume
95
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Constructing Faithful Representations of
Constructing Faithful Representations of Finitely-generated Torsion-free Nilpotent Groups
โœ Willem A. de Graaf; Werner Nickel ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

We formulate an algorithm for calculating a representation by unipotent matrices over the integers of a finitely-generated torsion-free nilpotent group given by a polycyclic presentation. The algorithm works along a polycyclic series of the group, each step extending a representation of an element o

Algorithmic Methods for Finitely Generat
Algorithmic Methods for Finitely Generated Abelian Groups
โœ Henri Cohen; Francisco Diaz Y Diaz; Michel Olivier ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 357 KB

We describe algorithmic tools to compute with exact sequences of Abelian groups. Although simple in nature, these are essential for a number of applications such as the determination of the structure of (Z K /m) \* for an ideal m of a number field K, of ray class groups of number fields, and of cond

Finding Intersections and Normalizers in
Finding Intersections and Normalizers in Finitely Generated Nilpotent Groups
โœ E.H. LO ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 475 KB

We present algorithms for computing intersections, normalizers and subgroup products of subgroups in finitely generated nilpotent groups given by nilpotent presentations. The problems are reduced to solving for certain minimal solutions in linear Diophantine equations over the integers. Performance