Related papers: Product-free sets in the free semigroup

Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers, containing zero, with finite complement. Its multiplicity $m$ is its smallest nonzero element. The Apery set of $S$ is the set $\text{Ap}(S) = \{n \in S :…

An element $g$ of a group $G$ is a test element if every endomorphism of $G$ that fixes $g$ is an automorphism. Let $G$ be a free group of finite rank, an orientable surface group of genus $n \geq 2$, or a non-orientable surface group of…

We analyse the subgroup structure of direct products of groups. Earlier work on this topic has revealed that higher finiteness properties play a crucial role in determining which groups appear as subgroups of direct products of free groups…

If $G$ is a group, we say a subset $S$ of $G$ is product-free if the equation $xy=z$ has no solutions with $x,y,z \in S$. For $D \in \mathbb{N}$, a group $G$ is said to be $D$-quasirandom if the minimal dimension of a nontrivial complex…

In this paper we study the asymptotic probability that a random system of equations in free abelian group $\mathbb{Z}^m$ of rank $m$ is solvable. Denote $SAT(\mathbb{Z}^m, k, n)$ and $SAT_{\mathbb{Q}^m}(\mathbb{Z}^m, k, n)$ the sets of all…

We prove a density version of the Carlson--Simpson Theorem. Specifically we show the following. For every integer $k\geq 2$ and every set $A$ of words over $k$ satisfying \[\limsup_{n\to\infty} \frac{|A\cap [k]^n|}{k^n}>0\] there exist a…

Suppose a group $G$ is quasi-isometric to a free product of a finite set $S$ of finitely generated abelian groups; let $S'$ denote the set of ranks of the free abelian parts of the groups in $S$. Then $G$ is commensurable with the free…

The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…

We prove that for any sequence of binary alphabets $\mathcal{A}_1,\mathcal{A}_2,\dots$, there exists a cube-free word $c_1c_2\dots$ so that $c_1\in\mathcal{A}_1,c_2\in\mathcal{A}_2,\dots$. In particular, for every $n$, there are at least…

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. We determine the precise size of the largest $\mathcal{L}$-free subset of $[n]$ for…

Cameron and Erd\H{o}s raised the question of how many maximal sum-free sets there are in $\{1, \dots , n\}$, giving a lower bound of $2^{\lfloor n/4 \rfloor }$. In this paper we prove that there are in fact at most $2^{(1/4+o(1))n}$ maximal…

The free product of an arbitrary pair of finite hyperfinite von Neumann algebras is examined, and the result is determined to be the direct sum of a finite dimensional algebra and an interpolated free group factor $L(\freeF_r)$. The finite…

Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…

Motzkin posed the problem of finding the maximal density $\mu(M)$ of sets of integers in which the differences given by a set $M$ do not occur. The problem is already settled when $|M|\leq 2$ and $M$ is a finite arithmetic progression. In…

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 consider a measure of similarity for infinite words that generalizes the notion of asymptotic or natural density of subsets of natural numbers from number theory. We show that every overlap-free infinite binary word, other than the…

We introduce a family of atomic measures on free groups generated by no-return random walks. These measures are shown to be very convenient for comparing "relative sizes" of subgroups, context-free and regular subsets (that, subsets…

We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in 1965. Among other things, we give a…

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…