BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Finding three-term arithmetic progressions in dense sets of intege
 rs - Thomas Bloom (Cambridge)
DTSTART:20190122T143000Z
DTEND:20190122T153000Z
UID:TALK116920@talks.cam.ac.uk
CONTACT:Beth Romano
DESCRIPTION:One of the most famous theorems in arithmetic combinatorics is
  Roth's theorem: any dense set of integers contains infinitely many non-tr
 ivial three-term arithmetic progressions. Since its first proof in 1953\, 
 a great deal of effort has gone into improving the quantitative bounds. I 
 will give an overview of the methods used\, the history of the bounds obta
 ined\, and the current state of the art.
LOCATION:MR13
END:VEVENT
END:VCALENDAR