Related papers: On the largest sum-free subset problem in the inte…

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…

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…

We show that if A is a finite set of integers then it has a subset S of size \log^{1+c} |A| (c>0 absolute) such that s+s' is never in A when s and s' are distinct elements of S.

Let $\mathscr{M}_{(2,1)}(N)$ be the infimum of the largest sum-free subset of any set of $N$ positive integers. An old conjecture in additive combinatorics asserts that there is a constant $c=c(2,1)$ and a function $\omega(N)\to\infty$ as…

It is well-known that for a prime $p\equiv 2\pmod 3$ and integer $n\ge 1$, the maximum possible size of a sum-free subset of the elementary abelian group $\mathbb Z_p^n$ is $\frac13\,(p+1)p^{n-1}$. We establish a matching stability result…

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…

We show that there is a constant $C>0$ such that for each integer $n\geq 1$, there is a poset on at most $2^{2n/3+C\sqrt{n}}$ elements that contains each $n$-element poset as an (induced) subposet.

A subset $A$ of a group $G$ is called product-free if there is no solution to $a=bc$ with $a,b,c$ all in $A$. It is easy to see that the largest product-free subset of the symmetric group $S_n$ is obtained by taking the set of all odd…

Using the polynomial method in additive number theory, this article establishes a new addition theorem for the set of subsums of a set satisfying $A\cap(-A)=\emptyset$ in $\mathbb{Z}/p\mathbb{Z}$:…

We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our…

Let $\mathbb Z_n$ be the cyclic group of order $n \ge 3$ additively written. S. Savchev \& F. Chen (2007) proved that for each zero-sum free sequence $S = a_1 \bullet \dots \bullet a_t$ over $\mathbb Z_n$ of length $t > n/2$, there is an…

For a rational number $r>1$, a set $A$ of positive integers is called an $r$-multiple-free set if $A$ does not contain any solution of the equation $rx = y$. The extremal problem on estimating the maximum possible size of $r$-multiple-free…

The Minkowski sum of two subsets $A$ and $B$ of a finite abelian group $G$ is defined as all pairwise sums of elements of $A$ and $B$: $A + B = \{ a + b : a \in A, b \in B \}$. The largest size of a $(k, \ell)$-sum-free set in $G$ has been…

A subset of a group is product-free if it does not contain elements a, b, c such that ab = c. We review progress on the problem of determining the size of the largest product-free subset of an arbitrary finite group, including a lower bound…

A finite subset $A$ of an abelian group $G$ is said to be zero-free if the identity element of $G$ cannot be written as a sum of distinct elements from $A$. In this article we study the structure of zero-free subsets of $Z/pZ$ the…

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…

Let A be a zero-sum free subset of Z_n with |A|=k. We compute for k\le 7 the least possible size of the set of all subset-sums of A.

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,…

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

In this paper, we give a lower bound for the maximum size of a $k$-colored sum-free set in $\mathbb{Z}_m^n$, where $k\geq 3$ and $m\geq 2$ are fixed and $n$ tends to infinity. If $m$ is a prime power, this lower bound matches (up to lower…