English

Random nilpotent groups, polycyclic presentations, and Diophantine problems

Group Theory 2016-12-09 v1

Abstract

We introduce a model of random f.g., torsion-free, 22-step nilpotent groups (in short, τ2\tau_2-groups). To do so, we show that these are precisely the groups that admit a presentation of the form \labeltau2pres0A,C[ai,aj]=tctλt,i,j (i<j), [A,C]=[C,C]=1, \label{tau2pres_0}\langle A, C \mid [a_i, a_j]= \prod_t {\scriptstyle c_t^{\scriptscriptstyle \lambda_{t,i,j}}} \ (i< j), \ [A,C]=[C,C]=1\rangle, where A={a1,,an}A=\{a_1, \dots, a_n\}, and C={c1,,cm}C=\{c_1, \dots, c_m\}. Hence, one may select a random τ2\tau_2-group GG by fixing AA and CC, and then randomly choosing exponents λt,i,j\lambda_{t,i,j} with λt,i,j|\lambda_{t,i,j}|\leq \ell, for some \ell. We prove that, if mn11m\geq n-1\geq 1, then the following holds asymptotically almost surely, as \ell\to \infty: The ring of integers Z\mathbb{Z} is e-definable in GG, systems of equations over Z\mathbb{Z} are reducible to systems over GG (and hence they are undecidable), the maximal ring of scalars of GG is Z\mathbb{Z}, GG is indecomposable as a direct product of non-abelian factors, and Z(G)=CZ(G)=\langle C \rangle. If, additionally, mn(n1)/2m \leq n(n-1)/2, then GG is regular (i.e. Z(G)Is(G)Z(G)\leq {\it Is}(G')). This is not the case if m>n(n1)/2m > n(n-1)/2. In the last section of the paper we introduce similar models of random polycyclic groups and random f.g. nilpotent groups of any nilpotency step, possibly with torsion. We quickly see, however, that the latter yields finite groups a.a.s.

Keywords

Cite

@article{arxiv.1612.02651,
  title  = {Random nilpotent groups, polycyclic presentations, and Diophantine problems},
  author = {Albert Garreta and Alexei Miasnikov and Denis Ovchinnikov},
  journal= {arXiv preprint arXiv:1612.02651},
  year   = {2016}
}

Comments

23 pages. arXiv admin note: text overlap with arXiv:1612.01242

R2 v1 2026-06-22T17:17:27.380Z