Algorithmic Methods for Finitely Generated Abelian Groups

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 (ZK / m) * for an ideal m of a number field K, of ray class groups of number fields, and of conductors of the corresponding Abelian extensions.