University of Cambridge > Talks.cam > Combinatorics Seminar > Counting problems in additive combinatorics

Counting problems in additive combinatorics

Add to your list(s) Download to your calendar using vCal

  • UserJozsi Balogh (University of Illinois Urbana-Champaign)
  • ClockThursday 02 March 2017, 14:30-15:30
  • HouseMR12.

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

In 1990 and 1999, Cameron and Erdos proposed several problems in additive combi natorics. They asked about the number of sum-free sets, number of maximal sum-free sets, number of Sidon sets in [n]. Additionally they asked the number of sets in [n] containing no k-term arithmetic progression. In the talk we survey the recent progress on these questions. One of the major tool in the proof is the recently developed container lemma. The talk is based on joint results with Hong Liu, Robert Morris, Wojciech Samotij, Maryam Sharifzadeh and and Andrew Treglown.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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