BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ashwin Sah (MIT)
DTSTART:20200528T170000Z
DTEND:20200528T180000Z
DTSTAMP:20260404T143403Z
UID:WAC/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/WAC/2
 /">Diagonal Ramsey via effective quasirandomness</a>\nby Ashwin Sah (MIT) 
 as part of Webinar in Additive Combinatorics\n\n\nAbstract\nWe improve the
  upper bound for diagonal Ramsey numbers to\n\\[\nR(k+1\,k+1)\\le\\exp(-c(
 \\log k)^2)\\binom{2k}{k}\n\\]\nfor $k\\ge 3$. To do so\, we build on a qu
 asirandomness and induction framework for Ramsey numbers introduced by Tho
 mason and extended by Conlon\, demonstrating optimal ``effective quasirand
 omness'' results about convergence of graphs. This optimality represents a
  natural barrier to improvement.\n
LOCATION:https://stable.researchseminars.org/talk/WAC/2/
END:VEVENT
END:VCALENDAR