Related papers: First-order sentences in random groups III

We characterize all ordered Abelian groups whose first order theory in the language {+,<} is strongly dependent. The main result of this note was obtained independently by Halevi-Hasson and Farr\'e.

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 is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…

We prove that there is a first-order sentence in the language of rings that is true for all finitely generated fields of characteristic 0 and false for all fields of characteristic >0. We also prove that for each n in N, there is a…

We give a simple new proof that regular languages defined by first-order sentences with no quantifier alteration can be defined by such sentences in which only regular atomic formulas appear. Earlier proofs of this fact relied on arguments…

It was shown in Part I that there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski-dense. Here we show…

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

Let G be a finitely generated free, free abelian of arbitrary exponent, free nilpotent, or free solvable group, or a free group in the variety A_mA_n, and let A = {a_1,..., a_r} be a basis for G. We prove that, in most cases, if S is a…

We prove that the set of orders of finite quotients of a finitely generated group has natural density 0, 1/2 or 1, and characterise when each of these cases occurs. We apply this to show that the sets of orders of various families of…

We show that for any finite group $G$ and for any $d$ there exists a word $w\in F_{d}$ such that a $d$-tuple in $G$ satisfies $w$ if and only if it generates a solvable subgroup. In particular, if $G$ itself is not solvable, then it cannot…

We prove that product-free sets of the free group over a finite alphabet have maximum density $1/2$ with respect to the natural measure that assigns total weight one to each set of irreducible words of a given size. This confirms a…

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…

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

Sacerdote [Sa] has shown that the non-Abelian free groups satisfy precisely the same universal-existential sentences Th(F$_2$)$\cap \forall \exists $ in a first-order language L$_o$ appropriate for group theory. It is shown that in every…

In this paper, we study the density of subsets of nonabelian free groups using relative densities of languages. We start by proving some basic properties about the density of a language $L_1$ relative to another language $L_2$ containing…

In this short note we answer to a question of group theory from arXiv:0910.5080. In that paper the author describes the set of realizable Steinitz classes for so-called $A'$-groups of odd order, obtained iterating some direct and semidirect…

If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…

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.

We investigate two notions about descriptions of groups using first-order language: quasi-finite axiomatizability, concerning infinite groups, and polylogarithmic compressibility, concerning classes of finite groups.

A group is $\textit{finitely axiomatizable}$ (FA) in a class $\mathcal{C}$ if it can be determined up to isomorphism within $\mathcal{C}$ by a sentence in the first-order language of group theory. We show that profinite groups of various…