BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20251208T150000
DTEND;TZID=America/New_York:20251208T160000
DTSTAMP:20260501T082708
CREATED:20251202T152832Z
LAST-MODIFIED:20251202T160431Z
UID:10003841-1765206000-1765209600@cmsa.fas.harvard.edu
SUMMARY:Computing WKB periods 
DESCRIPTION:Quantum Field Theory and Physical Mathematics Seminar \nSpeaker: Max Meynig\, University of Connecticut \nTitle: Computing WKB periods \nAbstract:  In one dimensional quantum mechanics\, the all-orders WKB method leads to ‘quantum periods’ which are formal power series in \hbar whose coefficients are certain period integrals. These periods\, which limelight in supersymmetric/string theories\, have rich structure and can be computed in a number of ways. I will discuss a new perspective on them and their computation.
URL:https://cmsa.fas.harvard.edu/event/qft_12825/
LOCATION:CMSA Room G02\, 20 Garden Street\, Cambridge\, MA\, 02138
CATEGORIES:Quantum Field Theory and Physical Mathematics
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-QFT-and-Physical-Mathematics-12.8.25.docx-scaled.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20251208T163000
DTEND;TZID=America/New_York:20251208T173000
DTSTAMP:20260501T082708
CREATED:20251202T153625Z
LAST-MODIFIED:20251202T162404Z
UID:10003843-1765211400-1765215000@cmsa.fas.harvard.edu
SUMMARY:Recent Advances in Probabilistically Checkable Proofs
DESCRIPTION:Colloquium \nSpeaker: Dor Minzer (MIT) \nTitle: Recent Advances in Probabilistically Checkable Proofs \nAbstract: The PCP Theorem is a cornerstone of computer science\, with applications to hardness of approximation\, verification\, interactive protocols and more. It asserts a witness for the satisfiability of a given 3CNF formula can be encoded in a robust way that allows local checking.In this talk we discuss recent developments in PCPs\, and their connection with distributed protocols\, high-dimensional expanders and discrete Fourier analysis. Based on joint works with Kai Zhe Zheng\, Mitali Bafna\, Noam Lifshitz\, Nikhil Vyas.
URL:https://cmsa.fas.harvard.edu/event/colloquium-12825/
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-12.8.2025.docx-scaled.png
END:VEVENT
END:VCALENDAR