Algorithmic methods for finitely generated Abelian groups

DOI10.1006/JSCO.2000.1014MaRDI QIDQ5928885zbMATH OpenOpenAlexFDO

Authors 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

Abelian groupsalgorithmsrelations

Mathematics Subject Classification ID

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

Review text

The main base of the intent to apply (matrix) algorithms for derivation of results on Abelian groups is the fact that if written additively, representation of elements and relations turns to linear matrix and vector algebra of integer elements. The authors prefer to use a different mode of writing.NEWLINENEWLINENEWLINEFür Gruppen, welche durch einen Satz von Relationen definiert sind, werden Vorgehensweisen beim Einsatz entsprechender Rechner-Programme mit den zugrunde liegenden Matrix-Relationen beschrieben; hierzu wird die in \textit{H. Cohen} [A course in computational number theory (Graduate Texts 138) (1993; Zbl 0786.11071)] behandelte `exakte Folge' verwendet und damit werden die benötigten Berechnungen abgeleitet: Untergruppen lassen sich dann durch `leicht' ableitbare Matrizen beschreiben und effizient maschinell ermitteln; ebenso Quotienten von Gruppen; weiterhin Berechnen von Erweiterung, Kern, Inverses Abbild, Aufsuchen aller Untergruppen; ferner Anwendungen in Klassenkörper-Theorie. In allen Fällen ist beschrieben, wie die daraus abzuleitenden Algorithmen aufgebaut sind und benötigte Sätze dazu bewiesen.

Recommendations

• Analysis of algorithms on problems in general abelian groups
• scientific article; zbMATH DE number 1775057
• scientific article; zbMATH DE number 4033867
• Linear groups and computation
• The computational matrix group project.
• Development of computer-assisted algebraic research
• scientific article; zbMATH DE number 665470
• Elementare Algorithmen aus der Gruppentheorie. (Elementary algorithms in group theory)
• Torsionsfreie Abelsche Gruppen vom endlichen Rang.
• Computing with matrix groups over infinite fields.

Cites work

• Advanced Topics in Computional Number Theory
• Class Groups of Number Fields: Numerical Heuristics
• scientific article; zbMATH DE number 3889661 (Why is no real title available?)
• scientific article; zbMATH DE number 4146057 (Why is no real title available?)
• scientific article; zbMATH DE number 1113824 (Why is no real title available?)
• Subgroup lattices and symmetric functions
• Subgroups of Abelian Groups

Cited in

(13)

• A new regulator of Gross type
• A survey of computational class field theory
• The \(p\)-group generation algorithm
• Efficient algorithms for the basis of finite abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• scientific article; zbMATH DE number 3871319 (Why is no real title available?)
• A method for deciding whether the Galois group is abelian
• Computing ray class groups, conductors and discriminants
• scientific article; zbMATH DE number 1501081 (Why is no real title available?)
• Solving norm equations in relative number fields using $S$-units
• Subgroup lattice algorithms related to extending and lifting Abelian groups.
• Computer Algebra in Scientific Computing
• Algebraically structured LWE, revisited

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

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