BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Professor Larry Guth (MIT Mathematics)
DTSTART:20210707T180000Z
DTEND:20210707T190000Z
DTSTAMP:20260404T092655Z
UID:MIT_Mathematics/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/MIT_M
 athematics/1/">Focusing waves and combinatorics of lines</a>\nby Professor
  Larry Guth (MIT Mathematics) as part of SPUR / RSI Lectures\n\n\nAbstract
 \nSolutions of the wave equation model sound waves\, light waves\, etc.  F
 ocusing refers to the amplitude getting very large in a small region of sp
 ace.  Estimating how much waves can focus is a problem in real analysis.  
 Over the last 25 years\, mathematicians have approached this problem using
  ideas from combinatorics about the intersection patterns of lines.  The s
 tory involves parts of math that sound rather far from PDE\, such as some 
 topology and some finite fields.  In this talk\, we will begin with a gent
 le introduction to waves and the wave equation\, and then describe how ide
 as from some of these other fields come into play.\n\nzoom link:  https://
 mit.zoom.us/j/93882149522\n
LOCATION:https://stable.researchseminars.org/talk/MIT_Mathematics/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alexei Borodin (MIT Mathematics)
DTSTART:20210721T180000Z
DTEND:20210721T190000Z
DTSTAMP:20260404T092655Z
UID:MIT_Mathematics/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/MIT_M
 athematics/2/">Domino tilings of the Aztec diamond</a>\nby Alexei Borodin 
 (MIT Mathematics) as part of SPUR / RSI Lectures\n\n\nAbstract\nThe talk i
 s a survey of one of the most beautiful solvable probabilistic models and 
 its relations with other fields - interacting particle systems\, random in
 terfaces in 3d\, and random matrices.\n
LOCATION:https://stable.researchseminars.org/talk/MIT_Mathematics/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lisa Sauermann (MIT Mathematics)
DTSTART:20210804T180000Z
DTEND:20210804T190000Z
DTSTAMP:20260404T092655Z
UID:MIT_Mathematics/3
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/MIT_M
 athematics/3/">On the cap-set problem and the slice rank polynomial method
 </a>\nby Lisa Sauermann (MIT Mathematics) as part of SPUR / RSI Lectures\n
 \n\nAbstract\nIn 2016\, Ellenberg and Gijswijt made a breakthrough on the 
 famous cap-set problem\, which asks about the maximum size of a subset of 
 \\mathbb{F}_3^n not containing a three-term arithmetic progression. They p
 roved that any such set has size at most 2.756^n. Their proof was later re
 formulated by Tao\, introducing what is now called the slice rank polynomi
 al method. This talk will explain Tao's proof of the Ellenberg-Gijswijt bo
 und for the cap-set problem\, and discuss some related problems.\n\nzoom l
 ink:  https://mit.zoom.us/j/93882149522\n\nAlso\, our big wrap-up SPUR Con
 ference will be held next Friday\, August 6\, where our SPUR/SPUR+ student
 s will report on their summer's work.  More details on that to follow next
  week...\n
LOCATION:https://stable.researchseminars.org/talk/MIT_Mathematics/3/
END:VEVENT
END:VCALENDAR