Metabelian groups: full-rank presentations, randomness and Diophantine problems

Abstract

We study metabelian groups G given by full rank finite presentations A R M in the variety M of metabelian groups. We prove that G is a product of a free metabelian subgroup of rank \0, |A|-|R|\ and a virtually abelian normal subgroup, and that if |R| ≤ |A|-2 then the Diophantine problem of G is undecidable, while it is decidable if |R|≥ |A|. We further prove that if |R| ≤ |A|-1 then in any direct decomposition of G all, but one, factors are virtually abelian. Since finite presentations have full rank asymptotically almost surely, finitely presented metabelian groups satisfy all the aforementioned properties asymptotically almost surely.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…