Related papers: Product-free sets in the free group

In this paper, we study product-free subsets of the free semigroup over a finite alphabet $A$. We prove that the maximum density of a product-free subset of the free semigroup over $A$, with respect to the natural measure that assigns a…

The free semigroup $\mathcal{F}$ over a finite alphabet $\mathcal{A}$ is the set of all finite words with letters from $\mathcal{A}$ equipped with the operation of concatenation. A subset $S$ of $\mathcal{F}$ is $k$-product-free if no…

We consider sets of positive integers containing no sum of two elements in the set and also no product of two elements. We show that the upper density of such a set is strictly smaller than 1/2 and that this is best possible. Further, we…

This paper studies the maximal size of product-free sets in Z/nZ. These are sets of residues for which there is no solution to ab == c (mod n) with a,b,c in the set. In a previous paper we constructed an infinite sequence of integers…

We show that there are sets of integers with asymptotic density arbitrarily close to 1 in which there is no solution to the equation ab=c, with a,b,c in the set. We also consider some natural generalizations, as well as a specific numerical…

Given two sets of natural numbers $\mathcal{A}$ and $\mathcal{B}$ of natural density $1$ we prove that their product set $\mathcal{A}\cdot \mathcal{B}:=\{ab:a\in\mathcal{A},\,b\in\mathcal{B}\}$ also has natural density $1$. On the other…

In a previous work, Bettin, Koukoulopoulos, and Sanna prove that if two sets of natural numbers $A$ and $B$ have natural density $1$, then their product set $A \cdot B := \{ab : a \in A, b \in B\}$ also has natural density $1$. They also…

Let $G$ be a group, and $S$ a non-empty subset of $G$. Then $S$ is \emph{product-free} if $ab\notin S$ for all $a, b \in S$. We say $S$ is \emph{locally maximal product-free} if $S$ is product-free and not properly contained in any other…

Let $G$ be a finite group and $S$ a subset of $G$. Then $S$ is product-free if $S \cap SS = \emptyset$, and complete if $G^{\ast} \subseteq S \cup SS$. A product-free set is locally maximal if it is not contained in a strictly larger…

Finite alphabets of at least three letters permit the construction of square-free words of infinite length. We show that the entropy density is strictly positive and derive reasonable lower and upper bounds. Finally, we present an…

Recall that a subset $X$ of a group $G$ is 'product-free' if $X^2\cap X=\varnothing$, ie if $xy\notin X$ for all $x,y\in X$. Let $G$ be a group definable in a distal structure. We prove there are constants $c>0$ and $\delta\in(0,1)$ such…

For a positive integer $n$, let $[n]$ denote $\{1, \ldots, n\}$. For a 2-dimensional integer lattice point $\mathbf{b}$ and positive integers $k\geq 2$ and $n$, a \textit{$k$-sum $\mathbf{b}$-free set} of $[n]\times [n]$ is a subset $S$ of…

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 present an elementary combinatorial argument showing that the density of a progression-free set in a finite r-dimensional vector space is O(1/r).

Let $A$ be the product of an abelian variety and a torus over a number field $K$, and let $m$ be a positive integer. If $\alpha \in A(K)$ is a point of infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that the…

Let $G$ be a finite group and $S$ a subset of $G$. Then $S$ is {\em product-free} if $S \cap SS = \emptyset$, and $S$ {\em fills} $G$ if $G^{\ast} \subseteq S \cup SS$. A product-free set is locally maximal if it is not contained in a…

We show that, in contrast to the integers setting, almost all even order abelian groups $G$ have exponentially fewer maximal sum-free sets than $2^{\mu(G)/2}$, where $\mu(G)$ denotes the size of a largest sum-free set in $G$. This confirms…

Given a finite family F of linear forms with integer coefficients, and a compact abelian group G, an F-free set in G is a measurable set which does not contain solutions to any equation L(x)=0 for L in F. We denote by d_F(G) the supremum of…

Palindromes are those reduced words of free products of groups that coincide with their reverse words. We prove that a free product of groups $G$ has infinite palindromic width, provided that $G$ is not the free product of two cyclic groups…

Two words have a reverse if they have the same pair of distinct letters on the same pair of positions, but in reversed order. A set of words no two of which have a reverse is said to be reverse-free. Let F(n,k) be the maximum size of a…