Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 99-115 |
| Number of pages | 17 |
| Journal | Groups, Complexity, Cryptology |
| Volume | 9 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Nov 2017 |
Keywords
- Diophantine problem
- Nilpotent groups
- Polycyclic groups
- Random groups
Fingerprint
Dive into the research topics of 'Random nilpotent groups, polycyclic presentations, and Diophantine problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver