University of Cambridge > Talks.cam > Combinatorics Seminar > Large Sum-free sets via L^1-estimates

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Large Sum-free sets via L^1-estimates

Download to your calendar using vCal

  • UserBenjamin Bedert (Cambridge)
  • ClockThursday 04 December 2025, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact .

A set B is said to be sum-free if there are no x,y,z in B with x+y=z. A classical probabilistic argument of Erdös shows that any set of N integers contains a sum-free subset of size N/3, and this was later improved to (N+1)/3 by Alon and Kleitman, and then to (N+2)/3 by Bourgain using an elaborate Fourier-analytic approach. We show that there exists a constant c>0 such that any set of N integers contains a sum-free subset of size N/3+c log log N, confirming the longstanding suspicion that the 2/3 in Bourgain’s bound can be improved to any large constant C (for large N). A key step in the proof consists of establishing inverse results giving combinatorial descriptions for sets of integers whose Fourier transform has small L^1-norm.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Fastmusic Cambridge Hi-tech Cluster and the Creative Industries Average on Sundays: 7478.48148148 kWh

Other talks

Carrollian momenta from anti de Sitter Security Cooperation within Government and between Governments Novel neuroimaging methods in Lewy body dementia Title to be confirmed Haematology and Palliative Care Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity