DRAFT
Caltech Logo

Discrete Analysis Seminar

Tuesday, January 18, 2022
3:00pm to 4:00pm
Add to Cal
Online Event
Results on the largest sum-free subsets of integers
Shukun Wu, Department of Mathematics, Caltech,

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 joint work with Yifan Jing.

For more information, please contact Math Department by phone at 626-395-4335 or by email at [email protected].