Metabelian groups: full-rank presentations, randomness and Diophantine problems
Group Theory
2020-06-12 v1
Abstract
We study metabelian groups given by full rank finite presentations in the variety of metabelian groups. We prove that is a product of a free metabelian subgroup of rank and a virtually abelian normal subgroup, and that if then the Diophantine problem of is undecidable, while it is decidable if . We further prove that if then in any direct decomposition of 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.
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