Counting sum-free sets in Abelian groups

Details Counting sum-free sets in Abelian groups Counting sum-free sets in Abelian groups

2012-01-31

arxiv.org/abs/1201.6654v1

Mathematics

Combinatorics

27 pages

Scientific paper

In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting. As a consequence, we determine the typical structure and asymptotic number of sum-free sets of order $m$ in Abelian groups $G$ whose order is divisible by a prime $q$ with $q \equiv 2 \pmod 3$, for every $m \ge C(q) \sqrt{n \log n}$, thus extending and refining a theorem of Green and Ruzsa. In particular, we prove that almost all sum-free subsets of size $m$ are contained in a maximum-size sum-free subset of $G$. We also give a completely self-contained proof of this statement for Abelian groups of even order, which uses spectral methods and a new bound on the number of independent sets of size $m$ in an $(n,d,\lambda)$-graph.

Affiliated with

Also associated with

No associations

Rating

Counting sum-free sets in Abelian groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting sum-free sets in Abelian groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting sum-free sets in Abelian groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57689