SearcharxivSearch

arXiv · 1612.02651

Random nilpotent groups, polycyclic presentations, and Diophantine problems

Abstract

We introduce a model of random f.g., torsion-free, $2$-step nilpotent groups (in short, $\tau_2$-groups). To do so, we show that these are precisely the groups that admit a presentation of the form $ \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=\{a_1, \dots, a_n\}$, and $C=\{c_1, \dots, c_m\}$. Hence, one may select a random $\tau_2$-group $G$ by fixing $A$ and $C$, and then randomly choosing exponents $\lambda_{t,i,j}$ with $|\lambda_{t,i,j}|\leq \ell$, for some $\ell$. We prove that, if $m\geq n-1\geq 1$, then the following holds asymptotically almost surely, as $\ell\to \infty$: The ring of integers $\mathbb{Z}$ is e-definable in $G$, systems of equations over $\mathbb{Z}$ are reducible to systems over $G$ (and hence they are undecidable), the maximal ring of scalars of $G$ is $\mathbb{Z}$, $G$ is indecomposable as a direct product of non-abelian factors, and $Z(G)=\langle C \rangle$. If, additionally, $m \leq n(n-1)/2$, then $G$ is regular (i.e. $Z(G)\leq {\it Is}(G')$). This is not the case if $m > 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Albert Garreta, Alexei Miasnikov, Denis Ovchinnikov. 2016-12-08. Random nilpotent groups, polycyclic presentations, and Diophantine problems. https://arxiv.org/abs/1612.02651

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR