Related papers: First-order sentences in random groups II: $\foral…

We prove that a random group, in Gromov's density model with $d<1/16$, satisfies a universal sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a nonabelian free group.

We show that a first-order sentence is almost surely true in a random group of density d<1/2 if and only if it is true in a non-abelian free group.

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove that for any given system of equations \Sigma, all the solutions of \Sigma over a random group of density d<\frac{1}{2} are…

Gromov asked what a typical (finitely presented) group looks like, and he suggested a way to make the question precise in terms of limiting density. The typical finitely generated group is known to share some important properties with the…

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove the existence of a uniform quantifier elimination procedure for formulas of minimal rank (probably the superstable part of the…

The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…

We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…

It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with 'solubility' replaced by 'nilpotence' and 'perfectness', among…

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

We introduce a new random group model called the square model: we quotient a free group on $n$ generators by a random set of relations, each of which is a reduced word of length four. We prove, as in the Gromov density model, that for…

Let $G$ be a random group in Gromov's density model $G(m,d,L)$ with $d<\tfrac12$. We prove a sharp quantitative constraint on products of conjugates equal to the identity: for every $n\ge1$ and $\varepsilon>0$, with overwhelming probability…

We prove that random groups in the Gromov density model at any density $d$ have with overwhelming probability no non-trivial left-orderable quotients. In particular, random groups at densities $d<\frac{1}{2}$ are not left-orderable.

A group $G$ has $FW_n$ if every action on a $n$-dimensional $\mathrm{CAT}(0)$ cube complex has a global fixed point. This provides a natural stratification between Serre's $FA$ and Kazhdan's $(T)$. For every $n$, we show that random groups…

In the density model of random groups, we consider presentations with any fixed number m of generators and many random relators of length l, sending l to infinity. If d is a "density" parameter measuring the rate of exponential growth of…

We provide a full and rigorous proof of a theorem attributed to \.Zuk, stating that random groups in the Gromov density model for d > 1/3 have property (T) with high probability. The original paper had numerous gaps, in particular, crucial…

We study random quotients of a fixed non-elementary hyperbolic group in the Gromov density model. Let $G=\langle S\;\vert\; T\rangle $ be a finite presentation of a non-elementary hyperbolic group, and let $Ann_{l,\omega }(G)$ be the set of…

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

We show that for every $n\ge 2$ there exists a torsion-free one-ended word-hyperbolic group $G$ of rank $n$ admitting generating $n$-tuples $(a_1,\ldots ,a_n)$ and $(b_1,\ldots ,b_n)$ such that the $(2n-1)$-tuples $$(a_1,\ldots ,a_n,…

In this work we continue the syntactic study of completeness that began with the works of Immerman and Medina. In particular, we take a conjecture raised by Medina in his dissertation that says if a conjunction of a second-order and a…

Let $F$ be a finitely generated non-abelian free group and $Q$ a finite quotient. Denote by $L_Q$ the language obtained by adding unary predicates $P_q$, $q\in Q$ to the language of groups. Using a slight generalization of some of the…