Random sum-free subsets of abelian groups

DOI10.1007/S11856-013-0071-2zbMATH Open1370.11040arXiv1103.2041OpenAlexW2143156974MaRDI QIDQ2017135FDOQ2017135

Authors: József Balogh, Robert Morris, Wojciech Samotij 

Publication date: 25 June 2014

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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}approxsqrtlogn/n$ above which, with high probability as $|G|oinfty$, each such subset is contained in a maximum-size sum-free subset of $G$, whenever $q$ divides $|G|$ for some (fixed) prime $q$ with $qequiv2pmod3$. Moreover, in the special case $$, 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.

Full work available at URL: https://arxiv.org/abs/1103.2041

Recommendations

• The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
• On maximal sum-free sets in abelian groups
• Sum-free sets in abelian groups
• Cameron-Erdős modulo a prime
• Publication:5749346
• Groups with few maximal sum-free sets
• Sum-free sets in Abelian groups.
• ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP
• Small maximal sum-free sets.
• On the number of maximal sum-free sets

zbMATH Keywords

threshold functionprobabilistic methodabelian groupssum-free sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30) Abelian groups (20K99)

Cites Work

• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• A structure theorem for Boolean functions with small total influences
• Every monotone graph property has a sharp threshold
• Hypergraph containers
• Independent sets in hypergraphs
• Arithmetic progressions of length three in subsets of a random set
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• On Certain Sets of Integers
• Counting sum-free sets in abelian groups
• Sharp thresholds of graph properties, and the $k$-sat problem
• Threshold functions
• Independent sets in regular graphs and sum-free subsets of finite groups
• A Szemerédi-type regularity lemma in abelian groups, with applications
• Counting sumsets and sum-free sets modulo a prime
• Mantel's theorem for random graphs
• On the Number of Sum-Free Sets
• Title not available (Why is that?)
• Rado Partition Theorem for Random Subsets of Integers
• THE CAMERON–ERDOS CONJECTURE
• Threshold Functions for Ramsey Properties
• Sum-free sets in Abelian groups.
• A combinatorial proof of the removal lemma for groups
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• On Schur properties of random subsets of integers
• Ramsey properties of random discrete structures
• A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
• Extremal subgraphs of random graphs
• Stability results for random discrete structures
• Randomness and regularity
• Sum-Free Sets of Integers
• Cameron-Erdős modulo a prime
• Maximal Sum-Free Sets of Group Elements
• Sum-free sets in abelian groups
• Maximal sum-free sets of elements of finite groups
• Extremal subgraphs of random graphs
• Title not available (Why is that?)
• On Sum-Free Subsequences
• A refinement of the Cameron-Erdős conjecture
• Random sum-free subsets of abelian groups
• Structure of maximal sum-free sets in groups of order $3p$

Cited In (10)

• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Random sum-free subsets of abelian groups
• On zero-sum free sequences contained in random subsets of finite cyclic groups
• The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
• The sum-free process
• Stability results for random discrete structures
• Interview with Joel Spencer
• Counting sum-free sets in abelian groups
• Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers
• When do random subsets decompose a finite group?

This page was built for publication: Random sum-free subsets of abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017135)