English

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

Group Theory 2020-06-12 v1

Abstract

We study metabelian groups GG given by full rank finite presentations ARM\langle A \mid R \rangle_{\mathcal{M}} in the variety M\mathcal{M} of metabelian groups. We prove that GG is a product of a free metabelian subgroup of rank max{0,AR}\max\{0, |A|-|R|\} and a virtually abelian normal subgroup, and that if RA2|R| \leq |A|-2 then the Diophantine problem of GG is undecidable, while it is decidable if RA|R|\geq |A|. We further prove that if RA1|R| \leq |A|-1 then in any direct decomposition of GG 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.

Keywords

Cite

@article{arxiv.2006.06371,
  title  = {Metabelian groups: full-rank presentations, randomness and Diophantine problems},
  author = {Albert Garreta and Leire Legarreta and Alexei Miasnikov and Denis Ovchinnikov},
  journal= {arXiv preprint arXiv:2006.06371},
  year   = {2020}
}

Comments

13 pages

R2 v1 2026-06-23T16:14:05.643Z