On the largest sum-free subset problem in the integers

2022/07/28 by Shakan, George
#11B13 #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2207.14210

Abstract

Let A ⊂ ℤ_>0 of size n. It is conjectured that for any C >0 and n large enough that A contains a sum-free subset of size at least n/3 +C. We study this problem and find an alternate proof of Bourgain's result that one make take C=2/3.

Related

• The largest (k, ℓ)-sum-free subsets
• Sharp bound on the number of maximal sum-free subsets of integers
• Large sum-free subsets of sets of integers via L¹-estimates for trigonometric series
• The number of maximal sum-free subsets of integers
• Sum-free Sets of Integers with a Forbidden Sum