TY - JOUR
T1 - Random nilpotent groups, polycyclic presentations, and Diophantine problems
AU - Garreta, Albert
AU - Miasnikov, Alexei
AU - Ovchinnikov, Denis
PY - 2017/11/1
Y1 - 2017/11/1
N2 - We introduce a model of random finitely generated, torsion-free, 2-step nilpotent groups (in short, τ2-groups). To do so, we show that these are precisely the groups with presentation of the form (A, C | [ai , aj] = Amt=1 cλt,i,jt (1 ≤ i < j ≤ n), [A, C] = [C, C] = 1>,where A = {a1, . . . , an} and C = {c1, . . . , cm}. Hence, a random G can be selected by fixing A and C, and then randomly choosing integers λt,i,j, with |λt,i,j| ≤ l for some l.We prove that if m ≥ n - 1 ≥ 1, then the following hold asymptotically almost surely as l → ∞: the ring Z is e-definable in G, the Diophantine problem over G is undecidable, the maximal ring of scalars of G is Z, G is indecomposable as a direct product of non-abelian groups, and Z(G) = (C).We further study when Z(G) ≤ Is(G'). Finally, 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.
AB - We introduce a model of random finitely generated, torsion-free, 2-step nilpotent groups (in short, τ2-groups). To do so, we show that these are precisely the groups with presentation of the form (A, C | [ai , aj] = Amt=1 cλt,i,jt (1 ≤ i < j ≤ n), [A, C] = [C, C] = 1>,where A = {a1, . . . , an} and C = {c1, . . . , cm}. Hence, a random G can be selected by fixing A and C, and then randomly choosing integers λt,i,j, with |λt,i,j| ≤ l for some l.We prove that if m ≥ n - 1 ≥ 1, then the following hold asymptotically almost surely as l → ∞: the ring Z is e-definable in G, the Diophantine problem over G is undecidable, the maximal ring of scalars of G is Z, G is indecomposable as a direct product of non-abelian groups, and Z(G) = (C).We further study when Z(G) ≤ Is(G'). Finally, 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.
KW - Diophantine problem
KW - Nilpotent groups
KW - Polycyclic groups
KW - Random groups
UR - http://www.scopus.com/inward/record.url?scp=85032942700&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85032942700&partnerID=8YFLogxK
U2 - 10.1515/gcc-2017-0007
DO - 10.1515/gcc-2017-0007
M3 - Article
AN - SCOPUS:85032942700
SN - 1867-1144
VL - 9
SP - 99
EP - 115
JO - Groups, Complexity, Cryptology
JF - Groups, Complexity, Cryptology
IS - 2
ER -