Algorithmic methods for finitely generated Abelian groups

DOI10.1006/jsco.2000.1014zbMath1007.20031OpenAlexW2013785351MaRDI QIDQ5928885

Henri Cohen, Francisco Diaz y Diaz, Michel Olivier

Publication date: 26 March 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2000.1014

zbMATH Keywords

relationsalgorithmsAbelian groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Finite abelian groups (20K01) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

Solving norm equations in relative number fields using $S$-units ⋮ Computing ray class groups, conductors and discriminants ⋮ A new regulator of Gross type ⋮ A survey of computational class field theory

Cites Work

• Class Groups of Number Fields: Numerical Heuristics
• Subgroup lattices and symmetric functions
• Subgroups of Abelian Groups
• Advanced Topics in Computional Number Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic methods for finitely generated Abelian groups