BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Aled Walker (CRM\, Montreal\, and Trinity College\, Cambridge)
DTSTART:20200601T143000Z
DTEND:20200601T145500Z
DTSTAMP:20260423T011111Z
UID:CANT2020/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2020/4/"
 >A tight structure theorem for sumsets</a>\nby Aled Walker (CRM\, Montreal
 \, and Trinity College\, Cambridge) as part of Combinatorial and additive 
 number theory (CANT 2021)\n\n\nAbstract\nIn joint work with Andrew Granvil
 le and George Shakan\, we show that for any finite set \n$$A=\\{ 0=a_0 < a
 _1< \\cdots < a_{m+1}=b\\}$$ of integers\, $NA$ is as predicted whenever \
 n$N\\geq b-m$\, and that this bound is "best possible" in several families
  of cases.\n
LOCATION:https://researchseminars.org/talk/CANT2020/4/
END:VEVENT
END:VCALENDAR