Work

On the largest sum-free subset problem in the integers

Year: 2022
Type: preprint
Abstract: Let $A \subset \mathbb{Z}_{>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$.
Language: English
Open Access status: green
OpenAlex ID: W4288804503
Cites:
Cited by: 1
Related to: 10