BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: In this talk we will look at a new variant of the polynomial m
 ethod which was first used to prove that sets avoiding 3-term arithmetic pr
 ogressions in groups like   Z   4   n   (Croot\, Lev and myself) and   Z   
 3   n   (Ellenberg and Gijswijt) are exponentially small (compared to the s
 ize of the group). We will discuss lower and upper bounds for the size of t
 he extremal subsets\, including some recent bounds found by Elsholtz and my
 self. We will also mention some further applications of the method\, for in
 stance\, the solution of the Erd ő s-Szemerédi sunflower conjecture. 
DTSTAMP:20181216T131500
DTSTART:20190107T141500
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Room 005 (Ground Floor)
SEQUENCE:0
SUMMARY:Péter Pál Pach (Budapest University of Technology and Economics): T
 he polynomial method and the cap set problem
UID:94863946@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20190107-L-Pal
 -Pach.html
END:VEVENT
END:VCALENDAR