Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity
Abstract
We study finitely generated nilpotent groups given by full rank finite presentations in the variety of nilpotent groups of class at most , where . We prove that if the deficiency is at least then the group is virtually free nilpotent, it is quasi finitely axiomatizable (in particular, first-order rigid), and it is almost (up to finite factors) directly indecomposable. One of the main results of the paper is that the Diophantine problem in nilpotent groups given by full rank finite presentations is undecidable if and decidable otherwise. We show that this class of groups is rather large since finite presentations asymptotically almost surely have full rank, so a random nilpotent group in the few relators model has a full rank presentation asymptotically almost surely. Full rank presentations give one a useful tool to approach random nilpotent groups and study their properties. Note, that the results above significantly improve our understanding of the Diophantine problem in finitely generated nilpotent groups: from a few special examples of groups with undecidable Diophantine problem we got to the place where we know that the Diophantine problem in all "typical" nilpotent groups is also undecidable.
Cite
@article{arxiv.1612.01242,
title = {Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity},
author = {Albert Garreta and Alexei Miasnikov and Denis Ovchinnikov},
journal= {arXiv preprint arXiv:1612.01242},
year = {2020}
}
Comments
v4: Title changed to the title of the published version of the paper. The previous title was "Diophantine problem, full rank presentations, and random nilpotent groups". Some arXiv references were updated. Now this paper is identical to the published one (except for the references). v3: Helpful referee suggestions were implemented. Some proofs were shortened as a result. 33 pages