BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Ical
BEGIN:VTIMEZONE
TZID:Asia/Jerusalem
BEGIN:STANDARD
DTSTART:20161030T020000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20170324T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.50215.field_date.0@mathematics.huji.ac.il
DTSTAMP:20210126T212039Z
CREATED:20180108T070016Z
DESCRIPTION:Date: \n\n2:30pm to 3:30pm\n\n\n\n\nSee also: Colloquium\, Ev
ents & SeminarsLocation: \n\nManchester Building (Hall 2)\, Hebrew Univers
ity Jerusalem\n\n\n A very old question in additive number theory is: how
large can a subset of Z/NZ be which contains no three-term arithmetic pro
gression? An only slightly younger problem is: how large can a subset of
(Z/3Z)^n be which contains no three-term arithmetic progression? The sec
ond problem was essentially solved in 2016\, by the combined work of a lar
ge group of researchers around the world\, touched off by a brilliantly si
mple new idea of Croot\, Lev\, and Pach. It turns out that this is yet an
other example where the so-called “polynomial method” gives a very short s
olution to an old and seemingly difficult problem in combinatorics. I’ll
explain the proof and talk about some of the many interesting research dir
ections that have been touched off by the new developments.\n\n Export\n
\n\n \nsubscribe iCal
DTSTART;TZID=Asia/Jerusalem:20161229T143000
DTEND;TZID=Asia/Jerusalem:20161229T153000
LAST-MODIFIED:20180115T102713Z
SUMMARY:Colloquium: Jordan Ellenberg (University of Wisconsin) 'The cap set
problem'
URL;TYPE=URI:https://mathematics.huji.ac.il/event/colloquium-jordan-ellenbe
rg-university-wisconsin-cap-set-problem
END:VEVENT
END:VCALENDAR