An old conjecture in additive combinatorics asks: what is the largest sum-free subset of any set of N positive integers? Here the word “largest” should be understood in terms of cardinality. In this talk, I will discuss some recent progress on this conjecture, and the analogous conjecture on (k,l)-sum-free sets. The main method we used is Fourier analysis.
This is a joint work with Yifan Jing.
This video is part of the Webinar in Additive Combinatorics series, and this is their YouTube channel.
