Related papers: Maximal sets with no solution to x+y=3z

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}$. In this paper we consider the following three general questions: (i) What is the size…

We count the ordered sum-free triplets of subsets in the group $\mathbb{Z}/p\mathbb{Z}$, i.e., the triplets $(A,B,C)$ of sets $A,B,C \subset \mathbb{Z}/p\mathbb{Z}$ for which the equation $a+b=c$ has no solution with $a\in A$, $b \in B$ and…

M\'oricz and Nagy introduced the problem of maximizing the number of $r$-element subsets with rational sums in an $n$-element set of irrational numbers, and showed that it is equivalent to an extremal zero-sum problem. They determined the…

A tri-colored sum-free set in an abelian group $H$ is a collection of ordered triples in $H^3$, $\{(a_i,b_i,c_i)\}_{i=1}^m$, such that the equation $a_i+b_j+c_k=0$ holds if and only if $i=j=k$. Using a variant of the lemma introduced by…

Let $A \subset \mathbb{Z}_{>0}$ of size $n$. It is conjectured that for any $C >0$ and $n$ large enough that $A$ contains a sum-free subset of size at least $n/3 +C$. We study this problem and find an alternate proof of Bourgain's result…

A set of integers is called sum-free if it contains no triple $(x,y,z)$ of not necessarily distinct elements with $x+y=z$. In this paper, we provide a structural characterisation of sum-free subsets of $\{1,2,\ldots,n\}$ of density at least…

A subset $S$ of the unit sphere $\mathbb{S}^2$ is called orthogonal-pair-free if and only if there do not exist two distinct points $u, v \in S$ at distance $\frac{\pi}{2}$ from each other. Witsenhausen \cite{witsenhausen} asked the…

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} +…

We prove the following conjecture of Shkredov and Solymosi: every subset $A \subset \mathbf{Z}^2$ such that $\sum_{a\in A\setminus\{0\}} 1/\left\|a\right\|^{2} = +\infty$ contains the three vertices of an isosceles right triangle. To do…

An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to…

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…

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…

Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x +y = z. We extend this concept by introducing the Schur degree of a subset of G, where Schur degree 1 corresponds to sumfree. The…

A finite set $A$ of integers is square-sum-free if there is no subset of $A$ sums up to a square. In 1986, Erd\H os posed the problem of determining the largest cardinality of a square-sum-free subset of $\{1, ..., n \}$. Answering this…

A set $A\subset \mathbb{F}_p^n$ is sum-free if $A+A$ does not intersect $A$. If $p\equiv 2 \mod 3$, the maximal size of a sum-free in $\mathbb{F}_p^n$ is known to be $(p^n+p^{n-1})/3$. We show that if a sum-free set $A\subset…

Given an Abelian groups $G$, denote $\mu(G)$ the size of its largest sum-free subset and $f_{\max}(G)$ the number of maximal sum-free sets in $G$. Confirming a prediction by Liu and Sharifzadeh, we prove that all even-order $G\ne…

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

In 1990, Alon and Kleitman proposed an argument for the sum-free subset problem: every set of n nonzero elements of a finite Abelian group contains a sum-free subset A of size |A|>\frac{2}{7}n. In this note, we show that the argument…

Let n be an integer, and consider finite sequences of elements of the group Z/nZ x Z/nZ. Such a sequence is called zero-sum free, if no subsequence has sum zero. It is known that the maximal length of such a zero-sum free sequence is 2n-2,…