BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Counting problems in additive combinatorics - Jozsi Balogh (Univer
 sity of Illinois Urbana-Champaign)
DTSTART:20170302T143000Z
DTEND:20170302T153000Z
UID:TALK70309@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION: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].  Additio
 nally 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 l
 emma. The talk is based on joint results with Hong Liu\, Robert Morris\, W
 ojciech\nSamotij\, Maryam Sharifzadeh and and Andrew Treglown.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR