Sumfree sets in groups: a survey

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 characterization for large sets $A$ in an abelian group $G$ which do not contain a subset $B$ of fixed size $k$ such that the sum of any two different elements of $B$ do not belong to $A$ (in other words, $B$ is sum-free with respect to $A$). Erd\H{o}s, in the above mentioned survey, conjectured that if $|A|$ is sufficiently large compared to $k$, then $A$ contains two elements that add up to zero. This is known to be true for $k \leq 3$. We give counterexamples for all $k \ge 4$. On the other hand, using the new characterization result, we are able to prove a positive result in the case when $|G|$ is not divisible by small primes.

[1]  Daniel Král,et al.  On the removal lemma for linear systems over Abelian groups , 2013, Eur. J. Comb..

[2]  W. T. Gowers,et al.  Hypergraph regularity and the multidimensional Szemerédi theorem , 2007, 0710.3032.

[3]  Vsevolod F. Lev,et al.  Sum-free sets in abelian groups , 2001 .

[4]  P. Erdos.  Extremal Problems in Number Theory , 2001 .

[5]  B. Green,et al.  Freiman's theorem in an arbitrary abelian group , 2005, math/0505198.

[6]  Terence Tao.  A variant of the hypergraph removal lemma , 2006, J. Comb. Theory, Ser. A.

[7]  Endre Szemerédi,et al.  A statistical theorem of set addition , 1994, Comb..

[8]  Ben Green,et al.  Sets of integers with no large sum-free subset , 2013, 1301.4579.

[9]  Renling Jin,et al.  Introduction of Nonstandard Methods for Number Theorists , 2007 .

[10]  Vojtech Rödl,et al.  Note on the 3-graph counting lemma , 2008, Discret. Math..

[11]  Anand Srivastav,et al.  Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets , 1999, RANDOM-APPROX.

[12]  Jehanne Dousse.  On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets , 2012, Mathematical Proceedings of the Cambridge Philosophical Society.

[13]  H. P. Yap,et al.  Maximal Sum-Free Sets of Elements of Finite Groups , 1969 .

[14]  Terence Tao,et al.  Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[15]  Terence Tao,et al.  An inverse theorem for the Gowers U^{s+1}[N]-norm , 2010 .

[16]  Ben Green,et al.  Sum-free sets in abelian groups , 2003 .

[17]  Probabilistic construction of small strongly sum-free sets via large Sidon sets , 2000 .

[18]  Sum-Avoiding Subsets , 2005 .

[19]  V. Rödl,et al.  The counting lemma for regular k-uniform hypergraphs , 2006 .

[20]  X. Shao.  Finding Linear Patterns of Complexity One , 2013, 1309.0644.

[21]  J. Bourgain.  Estimates related to sumfree subsets of sets of integers , 1997 .

[22]  A. Street,et al.  Maximal Sum-Free Sets in Elementary Abelian p-Groups , 1971, Canadian Mathematical Bulletin.

[23]  On strongly sum-free subsets of abelian groups , 1996 .

[24]  Anne Penfold Street,et al.  Maximal sum-free sets in finite abelian groups , 1970, Bulletin of the Australian Mathematical Society.