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

preprint2020arXivOpen access

Abstract

We study metabelian groups GG given by full rank finite presentations ⟨A∣R⟩M\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,∣A∣−∣R∣}\max\{0, |A|-|R|\} and a virtually abelian normal subgroup, and that if ∣R∣≤∣A∣−2|R| \leq |A|-2 then the Diophantine problem of GG is undecidable, while it is decidable if ∣R∣≥∣A∣|R|\geq |A|. We further prove that if ∣R∣≤∣A∣−1|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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.