Recognizing free metabelian groups

algorithm finitely generated metabelian group free \({\mathbb{Z}}Q\)-module free metabelian group generators isomorphism problem presentation relations

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16)

Review text

It is shown that there is an algorithm to determine whether or not a finitely generated metabelian group G (given via a presentation on finitely many generators \(x_ 1,...,x_ n\) with finitely many relations modulo the second derived group of the free group on \(x_ 1,...,x_ n)\) is isomorphic to a free metabelian group. The authors prove that G is free metabelian of rank k if and only if \(Q=G/[G,G]\) is free abelian of rank k and \(M={\mathbb{Z}}Q\otimes_{{\mathbb{Z}}G}IG\), where IG is the augmentation ideal of \({\mathbb{Z}}G\), is a free \({\mathbb{Z}}Q\)-module of rank k. The existence of the desired algorithm then follows from the existence of recursive procedures for determining from the given presentation of G whether or not Q is free abelian of rank k (this is easy) and M is a free \({\mathbb{Z}}Q\)-module of rank k.

Recommendations

Cited in

(14)

This page was built for publication: Recognizing free metabelian groups

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