BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Sets of integers with many solutions to a linear equation - James 
 Aaronson (University of Oxford)
DTSTART:20180517T133000Z
DTEND:20180517T143000Z
UID:TALK101356@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:It is possible to prove\, via a fairly elementary argument\, t
 hat the number of triples x+y=z in a set of integers of given size is maxi
 mised for the set [-n/2\, n/2]. Suppose we were to consider an equation wi
 th arbitrary coefficients\; it turns out that we can construct examples of
  sets which provide a uniform lower bound on the maximal number of solutio
 ns. In this talk\, we will discuss why such examples are\, in some sense\,
  optimal.\n
LOCATION:MR13
END:VEVENT
END:VCALENDAR