BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20221021T093000
DTEND;TZID=America/New_York:20221021T103000
DTSTAMP:20260417T084324
CREATED:20230825T081643Z
LAST-MODIFIED:20240215T093118Z
UID:10001300-1666344600-1666348200@cmsa.fas.harvard.edu
SUMMARY:The index of M-theory
DESCRIPTION:Algebraic Geometry in String Theory Seminar \nSpeaker: Nicolo Piazzalunga\, Rutgers \nTitle: The index of M-theory \nAbstract: I’ll introduce the higher-rank Donaldson-Thomas theory for toric Calabi-Yau threefolds\, within the setting of equivariant K-theory. I’ll present a factorization conjecture motivated by Physics. As a byproduct\, I’ll discuss some novel properties of equivariant volumes\, as well as their generalizations to the genus-zero Gromov-Witten theory of non-compact toric varieties.
URL:https://cmsa.fas.harvard.edu/event/agst-10212/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Algebraic Geometry in String Theory Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Algebraic-Geometry-in-String-Theory-10.21.2022.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20221021T110000
DTEND;TZID=America/New_York:20221021T120000
DTSTAMP:20260417T084324
CREATED:20230809T110107Z
LAST-MODIFIED:20240301T080144Z
UID:10001226-1666350000-1666353600@cmsa.fas.harvard.edu
SUMMARY:Explicit Ramsey Graphs and Two Source Extractors
DESCRIPTION:Speaker: David Zuckerman\, Harvard CMSA/University of Texas at Austin \nTitle: Explicit Ramsey Graphs and Two Source Extractors \nAbstract: Ramsey showed that any graph on N nodes contains a clique or independent set of size (log N)/2.  Erdos showed that there exist graphs on N nodes with no clique or independent set of size 2 log N\, and asked for an explicit construction of such graphs.  This turns out to relate to the question of extracting high-quality randomness from two independent low-quality sources.  I’ll explain this connection and our recent exponential improvement in constructing two-source extractors.
URL:https://cmsa.fas.harvard.edu/event/member-seminar-title-tba-5/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Member-Seminar-10.21.22.png
END:VEVENT
END:VCALENDAR