Universal equivalence of partially commutative metabelian groups. (Q619321)

Recall that a group whose derived subgroup is Abelian is called metabelian. The author considers free partially commutative metabelian groups, that is groups \(S_\Gamma\) in the variety of all metabelian groups with a finite presentation saying that two generators commute if and only if they are linked in a finite graph \(\Gamma\). He proves a theorem on approximability by torsion-free nilpotent groups and one on the structure of centralizers of arbitrary elements in the derived subgroup. He also proves that most elements of the derived subgroup have unique representations when \(\Gamma\) is a tree, fixing partially some problems in [\textit{Ch. K. Gupta} and \textit{E. I. Timoshenko}, ``Partially commutative metabelian groups: centralizers and elementary equivalence,'' Algebra Logika 48, No. 3, 309-341 (2009; Zbl 1245.20032)]. Then the main theorem of the paper gives necessary and sufficient conditions for the problem of deciding when two partially commutative metabelian groups are universally equivalent when the defining graphs are trees, supplying an effective algorithm for this problem.