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

Suppose that $A$ is a finite, nonempty subset of a cyclic group of either infinite or prime order. We show that if the difference set $A-A$ is ``not too large'', then there is a nonzero group element with at least as many as…

Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the…

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…

Let $G$ be a finite group of order $n$, and $Z_G=\mathbb{Z}\langle\zeta_{i,g}\mid g\in G,\ i=1,2,\dots,n\rangle$ be the free generic algebra, with canonical action of $G$ according to $(\zeta_{i,g})^x=\zeta_{i,x^{-1}g}$. It is proved that…

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…

We show that, if $w_1, \ldots , w_6$ are words which are not an identity of any (non-abelian) finite simple group, then $w_1(G)w_2(G) \cdots w_6(G) = G$ for all (non-abelian) finite simple groups $G$. In particular, for every word $w$,…

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

This is the second paper in a series of three, where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Here, for an arbitrary group $G$ of infinite words over an ordered abelian group…

In this paper we investigate Gromov's question: whether every one-ended word hyperbolic group contains a surface subgroup. The case of double groups is considered by studying the associated one relator groups. We show that the majority…

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…

A theorem of Gao, Jackson and Seward, originally conjectured to be false by Glasner and Uspenskij, asserts that every countable group admits a $2$-coloring. A direct consequence of this result is that every countable group has a strongly…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually…

A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties…

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…

We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes…

Let $\Sigma = X\cup X^{-1} = \{ x_1 ,x_2 ,..., x_m ,x_1^{-1} ,x_2^{-1} ,..., x_m^{-1} \}$ and let $G$ be a group with set of generators $\Sigma$. Let $\mathfrak{L} (G) =\left\{ \left. \omega \in \Sigma^* \; \right\vert \;\omega \equiv e \;…

This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…

Let $G$ be a $\sigma$-finite abelian group, i.e. $G=\bigcup_{n\geq 1} G_n$ where $(G_n)_{n\geq 1}$ is a non decreasing sequence of finite subgroups. For any $A\subset G$, let $\underline{\mathrm{d}}(A):=\liminf_{n\to\infty}\frac{|A\cap…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…