Papers
Topics
Authors
Recent
Search
2000 character limit reached

Random sum-free subsets of Abelian groups

Published 10 Mar 2011 in math.CO, math.GR, and math.PR | (1103.2041v2)

Abstract: We characterize the structure of maximum-size sum-free subsets of a random subset of an Abelian group $G$. In particular, we determine the threshold $p_c \approx \sqrt{\log n / n}$ above which, with high probability as $|G| \to \infty$, each such subset is contained in a maximum-size sum-free subset of $G$, whenever $q$ divides $|G|$ for some (fixed) prime $q$ with $q \equiv 2 \pmod 3$. Moreover, in the special case $G = \ZZ_{2n}$, we determine a sharp threshold for the above property. The proof uses recent 'transference' theorems of Conlon and Gowers, together with stability theorems for sum-free subsets of Abelian groups.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.