BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240304T163000
DTEND;TZID=America/New_York:20240304T173000
DTSTAMP:20260718T074114
CREATED:20240130T150912Z
LAST-MODIFIED:20240228T213450Z
UID:10000810-1709569800-1709573400@cmsa.fas.harvard.edu
SUMMARY:Strong bounds for arithmetic progressions
DESCRIPTION:Colloquium \nSpeaker: Raghu Meka (UCLA) \nTitle: Strong bounds for arithmetic progressions \nAbstract: Suppose you have a set S of integers from {1\,2\,…\,N} that contains at least N / C elements. Then for large enough N\, must S contain three equally spaced numbers (i.e.\, a 3-term arithmetic progression)? \nIn 1953\, Roth showed this is the case when C is roughly (log log N). Behrend in 1946 showed that C can be at most exp(sqrt(log N)). Since then\, the problem has been a cornerstone of the area of additive combinatorics. Following a series of remarkable results\, a celebrated paper from 2020 due to Bloom and Sisask improved the lower bound on C to C = (log N)^(1+c) for some constant c > 0. \nThis talk will describe a new work showing that C can be much closer to Behrend’s construction. Based on joint work with Zander Kelley.
URL:https://cmsa.fas.harvard.edu/event/colloquium-3424/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-03.04.2024-1.png
END:VEVENT
END:VCALENDAR