Sum-free sets in abelian groups

@article{Green2003SumfreeSI,
  title={Sum-free sets in abelian groups},
  author={Ben Green and Imre Z. Ruzsa},
  journal={Israel Journal of Mathematics},
  year={2003},
  volume={147},
  pages={157-188}
}
  • B. Green, I. Ruzsa
  • Published 10 July 2003
  • Mathematics
  • Israel Journal of Mathematics
LetA be a subset of an abelian groupG with |G|=n. We say thatA is sum-free if there do not existx, y, z εA withx+y=z. We determine, for anyG, the maximal densityμ(G) of a sum-free subset ofG. This was previously known only for certainG. We prove that the number of sum-free subsets ofG is 2(μ(G)+o(1))n, which is tight up to theo-term. For certain groups, those with a small prime factor of the form 3k+2, we are able to give an asymptotic formula for the number of sum-free subsets ofG. This… 
Sum-free set in finite abelian groups
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. In this paper we shall characterise
The number of additive triples in subsets of abelian groups
  • W. Samotij, B. Sudakov
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 2016
Abstract A set of elements of a finite abelian group is called sum-free if it contains no Schur triple, i.e., no triple of elements x, y, z with x + y = z. The study of how large the largest sum-free
Large Sum-free Sets in Abelian Groups
Let A be a subset of a finite abelian group G. We say that A is sum-free if the equation x + y = z, has no solution (x, y, z) with x, y, z belonging to the set A. In this paper we shall characterise
ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP
A subset A of a given finite abelian group G is called (k,l)-sum-free if the sum of k (not necessarily distinct) elements of A does not equal the sum of l (not necessarily distinct) elements of A. We
Sum-free subsets of finite abelian groups of type III
On the structure of large sum-free sets of integers
  • T. Tran
  • Mathematics
    Israel Journal of Mathematics
  • 2018
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
N ov 2 00 7 Product-free subsets of groups , then and now
Let G be a group. A subset S of G is product-free if there do not exist a, b, c ∈ S (not necessarily distinct) such that ab = c. One can ask about the existence of large product-free subsets for
A ug 2 00 7 Product-free subsets of groups , then and now
Let G be a group. A subset S of G is product-free if there do not exist a, b, c ∈ S (not necessarily distinct) such that ab = c. One can ask about the existence of large product-free subsets for
On Maximal Sum-Free Sets in Abelian Groups
Balogh, Liu, Sharifzadeh and Treglown [Journal of the European Mathematical Society, 2018] recently gave a sharp count on the number of maximal sum-free subsets of $\{1, \dots, n\}$, thereby
A pr 2 00 8 Generalizations of product-free subsets
In this paper, we present some generalizations of Gowers’s result about product-free subsets of groups. For any group G of order n, a subset A of G is said to be product-free if there is no solution
...
...

References

SHOWING 1-10 OF 44 REFERENCES
Maximal sum-free sets in finite abelian groups, V
  • H. Yap
  • Mathematics
    Bulletin of the Australian Mathematical Society
  • 1975
Let λ(G) be the cardinality of a maximal sum-free set in a group G. Diananda and Yap conjectured that if G is abelian and if every prime divisor of |G| is congruent to 1 modulo 3, then λ(G) =
Maximal sum-free sets in finite abelian groups
A subset S of an additive group G is called a maximal sum-free set in G if (S+S) ∩ S = ø and ∣S∣ ≥ ∣T∣ for every sum-free set T in G. It is shown that if G is an elementary abelian p–group of order
Sum-free sets in abelian groups
AbstractWe show that there is an absolute constant δ>0 such that the number of sum-free subsets of any finite abelian groupG is $$\left( {2^{\nu (G)} - 1} \right)2^{\left| G \right|/2} + O\left(
Counting sumsets and sum-free sets modulo a prime
TLDR
The number of distinct sets of the form A of residues modulo p that are said to be sum-free if there are no solutions to a = a′ + a″ with a, a′, a″ ∈ A is counted.
Independent sets in regular graphs and sum-free subsets of finite groups
It is shown that there exists a function∈(k) which tends to 0 ask tends to infinity, such that anyk-regular graph onn vertices contains at most 2(1/2+∈(k))n independent sets. This settles a
A Szemerédi-type regularity lemma in abelian groups, with applications
Abstract.Szemerédi’s regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemerédi’s regularity lemma in the
Cameron-Erdős Modulo a Prime
We prove that for p prime and sufficiently large, the number of subsets of Zp free of solutions of the equation x+y=z (that is, free of Schur triples) satisfies
Combinatorics: room squares, sum-free sets, Hadamard matrices
Now welcome, the most inspiring book today from a very professional writer in the world, combinatorics room squares sum free sets hadamard matrices. This is the book that many people in the world
Maximal Sum-Free Sets of Elements of Finite Groups
Abschätzungen der asymptotischen
  • Dichte von Summenmengen, Math. Z
  • 1958
...
...