Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Eisenbud Auditorium, Online/Virtual |
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
Finding large sum-free subsets
I will present a recent result of Bedert that every set of n integers has a sum-free subset of order at least n/3+clog log n. The proof proceeds via Fourier analysis and makes use of many nice concepts in additive combinatorics and number theory. I aim to present the more combinatorial portions of the proof in detail and sketch the remainder.
No Notes/Supplements Uploaded