BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Mehtaab Sawhney (MIT Mathematics)
DTSTART:20211202T230000Z
DTEND:20211203T000000Z
DTSTAMP:20260423T021058Z
UID:SPAMS/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SPAMS/7/">On
  the Hard Core Model and Enumerating Independent Sets</a>\nby Mehtaab Sawh
 ney (MIT Mathematics) as part of MIT Simple Person's Applied Mathematics S
 eminar\n\nLecture held in Room: 2 - 132 in the Simons Building.\n\nAbstrac
 t\nSeminal results of Weitz (2005) and Sly (2010) prove that one can in po
 lynomial time approximately count independent sets in 5-regular graphs but
  cannot approximately count independent sets in 6-regular graphs (unless N
 P=RP). We discuss these results in the broader context of sampling from th
 e hard core model and give a high level idea of the proof of each of these
  results.\n
LOCATION:https://researchseminars.org/talk/SPAMS/7/
END:VEVENT
END:VCALENDAR