Related papers: First-order sentences in random groups I: universa…

A set $G \subseteq \omega$ is $n$-generic for a positive integer $n$ if and only if every $\Sigma^0_n$ formula of $G$ is decided by a finite initial segment of $G$ in the sense of Cohen forcing. It is shown here that every $n$-generic set…

We prove a rigidity theorem for the geometry of the unit ball in random subspaces of the scl norm in B_1^H of a free group. In a free group F of rank k, a random word w of length n (conditioned to lie in [F,F]) has scl(w)=log(2k-1)n/6log(n)…

We prove that random groups in the Gromov density model at density d <1/4 do not have Property (T), answering a conjecture of Przytycki. We also prove similar results in the k-angular model of random groups.

A fundamental notion in group theory, which originates in an article of Ulam and von Neumann from $1947$ is uniform simplicity. A group $G$ is said to be $n$-uniformly simple for $n \in \mathbf{N}$ if for every $f,g\in G\setminus \{id\}$,…

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

We review some recent developments in 1-st order GLSM construction, or so-called Gross-Neveu formalism for sigma models. We recall the general idea behind this framework and describe a 1-st order GLSM data from which the general generalized…

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…

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…

A countable group is C*-simple if its reduced C*-algebra is a simple algebra. Since Powers recognised in 1975 that non-abelian free groups are C*-simple, large classes of groups which appear naturally in geometry have been identified,…

Given a finite non-cyclic group $G$, call $\sigma(G)$ the smallest number of proper subgroups of $G$ needed to cover $G$. Lucchini and Detomi conjectured that if a nonabelian group $G$ is such that $\sigma(G) < \sigma(G/N)$ for every…

The random triangular group \Gamma(n,t) is a group given by a presentation P=<S|R>, where S is a set of n generators and R is a random set of t cyclically reduced words of length three. The asymptotic behavior of \Gamma(n,t) is in some…

The Hanna Neumann conjecture states that if F is a free group, then for all finitely generated subgroups H,K <= F, rank(H intersect K) - 1 <= [ rank(H)-1 ] [ rank(K)-1 ] In this paper, we show that if one of the subgroups, say H, has a…

Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. Let SF(G) denotes the set of all sum-free subets of $G$ and $\sigma(G)$ denotes…

In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…

Let G be a connected real Lie group of dimension n. Then there exists a relatively compact open neighbourhood W of e in G such that for n+1 randomly chosen elements g_0,..,g_n the generated subgroup will be dense in G with probability one.

Starting out from results known for the most classical cases of N, Z^d, R^d or for sigma-finite abelian groups, here we define the notion of asymptotic uniform upper density in general locally compact abelian groups. Even if a bit…

We give a proof that groups satisfying the "uniform C'(1/6)" small cancellation condition admit a geometric action on a CAT(-1) space. It follows that random groups at density <1/12 are CAT(-1). The proof consists of a direct construction…

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…