BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.18.2//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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20270314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20271107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260915T090000
DTEND;TZID=America/New_York:20261121T170000
DTSTAMP:20260723T182727Z
CREATED:20251023T141842Z
LAST-MODIFIED:20260723T182727Z
UID:10003825-1789462800-1795280400@cmsa.fas.harvard.edu
SUMMARY:Lagrangian Floer Theory and Applications Program
DESCRIPTION:Lagrangian Floer theory and Applications Program \nDates: September 15–November 21\, 2026 \nLocation: CMSA G10\, 20 Garden St.\, Cambridge MA 02138 \nThis thematic program will focus on recent developments in Lagrangian Floer theory and applications.  These include the development of family Floer theory\, degeneration techniques\, Floer homotopy theory in the Lagrangian case\, Floer theory in prime characteristic\, and applications to problems in singularity theory\, geometry and dynamics. \nA one-week workshop will be held near the start of the program (September 28 – October 2\, 2026)\, with the same title as the thematic program. \nOrganizers: Denis Auroux (Harvard)\, Jonny Evans (Lancaster)\, and Chris Woodward (Rutgers) \n  \nTo express interest in attending the workshop or program\, and to apply for funding if available\, please fill out the form.  \nFunding from the National Science Foundation may be available for US-based graduate students and postdoctoral fellows. \n  \n \nimage: Water Sky Garden\, Vancouver\nDate: 31 January 2010\, 12:57:46\nSource: Studio Echelman\nAuthor: Peter Vanderwarker\, Studio Echelman \n 
URL:https://cmsa.fas.harvard.edu/event/lft2026/
LOCATION:CMSA 20 Garden Street Cambridge\, Massachusetts 02138 United States
CATEGORIES:Programs
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/LFT_poster-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261117T140000
DTEND;TZID=America/New_York:20261117T160000
DTSTAMP:20261106T191934Z
CREATED:20260819T195033Z
LAST-MODIFIED:20261106T191934Z
UID:10004039-1794924000-1794931200@cmsa.fas.harvard.edu
SUMMARY:Mathematical Economics Seminar: Experimental Design in Networks
DESCRIPTION:Speaker: Christopher Harshaw\, Columbia University \nTitle: Design-Based Minimax Theory for Network Experiments \nAbstract: Network experiments are used throughout the social and medical sciences to investigate causal effects under the presence of interference. While a large body of work has developed improved statistical procedures\, the fundamental limits of statistical estimation in these settings is less well understood. In this paper\, we develop and investigate a design-based theory of minimax risk for network experiments under an arbitrary neighborhood interference model. Our notion of minimax risk describes the optimal precision among all statistical procedures for investigating a particular causal effect on the observed interference network. We show that the minimax risk is a function of the corresponding conflict graph\, which captures inherent unobservability of estimand-relevant potential outcomes given the observed interference network. Our main contribution is a series of upper and lower bounds on the minimax rate in terms of local and global connectivity properties of the conflict graph. To illustrate their utility\, we apply these general results to obtain minimax analyses for two commonly studied effects: the direct treatment effect and global average treatment effect. \n  \nSpeaker: Evan Munro\, University of Chicago\, Booth School of Business \nTitle: Robust Signal Maximization in Spillover Experiments \nAbstract: We study the optimal design and analysis of experiments for estimating spillover effects. Assuming a known (e.g.\, linear) exposure mapping\, we characterize the treatment-assignment distribution and regression-based estimator that minimize worst-case asymptotic variance against a broad class of distributions of unobservables. The design problem yields an intuitive solution in which the planner trades off spillover signal strength against diffusion of spillover variation. The analysis problem yields a simple recentered instrumental variable estimator to best leverage this variation. This framework produces natural solutions in several benchmark cases – such as clustered exposure – and suggests computationally tractable approximations for general networks\, including bipartite settings. We illustrate these new tools in semi-synthetic experiments based on two applications from development economics. Our approach yields large standard error reductions in both experiments\, increasing effective sample sizes by 50-100% or more.
URL:https://cmsa.fas.harvard.edu/event/mathecon_111726/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Mathematical Economics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/2026/08/Mathematical-Economics-Seminar-11.17.2026.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261118T120000
DTEND;TZID=America/New_York:20261118T130000
DTSTAMP:20261104T152417Z
CREATED:20261102T194844Z
LAST-MODIFIED:20261104T152417Z
UID:10004060-1795003200-1795006800@cmsa.fas.harvard.edu
SUMMARY:The work of Jacob Tsimerman (ICM series)
DESCRIPTION:CMSA Q&A Seminar \nSpeaker: Aaron Landesman (Harvard CMSA) \nTitle: The work of Jacob Tsimerman (ICM series) \nAbstract: I will discuss some basics of the Fields Medal work of Jacob Tsimerman. Some of his key contributions come toward the André-Oort conjecture\, algebraicity of period maps\, and arithmetic statistics.
URL:https://cmsa.fas.harvard.edu/event/cmsaqa_111826/
LOCATION:Common Room\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:CMSA Q&A Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/2026/11/CMSA-Q-A-Seminar-11.18.2026.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261118T163000
DTEND;TZID=America/New_York:20261118T173000
DTSTAMP:20261113T161316Z
CREATED:20260729T161121Z
LAST-MODIFIED:20261113T161316Z
UID:10003969-1795019400-1795023000@cmsa.fas.harvard.edu
SUMMARY:Mathematics in the Age of AI: Discovery\, Verification and the Future of Proof
DESCRIPTION:AI for the Working Mathematician \nSpeaker: Ken Ono\, Axiom Math and University of Virginia \nTitle: Mathematics in the Age of AI: Discovery\, Verification and the Future of Proof \nAbstract: How is artificial intelligence changing mathematics? Drawing on my mathematical journey and recent work at Axiom Math\, I will discuss the discovery of new theorems and the formalization of major bodies of mathematics\, including the Classification of Finite Simple Groups and the Stacks Project. These examples raise fundamental questions about proof\, trust\, and the enduring role of human creativity.
URL:https://cmsa.fas.harvard.edu/event/ai_111826/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:AI for the Working Mathematician
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/2026/07/CMSA-AI-for-Mathematicians-Seminar-11.18.2026.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261119T163000
DTEND;TZID=America/New_York:20261119T173000
DTSTAMP:20260819T144137Z
CREATED:20260729T200318Z
LAST-MODIFIED:20260819T144137Z
UID:10004028-1795105800-1795109400@cmsa.fas.harvard.edu
SUMMARY:Geometry and Mathematical Physics seminar
DESCRIPTION:Geometry and Mathematical Physics seminar \nSpeaker: Joshua Greene\, Boston College
URL:https://cmsa.fas.harvard.edu/event/dgphys_111926/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Geometry and Mathematical Physics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261120T120000
DTEND;TZID=America/New_York:20261120T130000
DTSTAMP:20260729T193339Z
CREATED:20260729T193339Z
LAST-MODIFIED:20260729T193339Z
UID:10004007-1795176000-1795179600@cmsa.fas.harvard.edu
SUMMARY:Member Seminar
DESCRIPTION:Member Seminar \n 
URL:https://cmsa.fas.harvard.edu/event/member-seminar-112026/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261121T090000
DTEND;TZID=America/New_York:20261121T170000
DTSTAMP:20261112T151653Z
CREATED:20261015T145844Z
LAST-MODIFIED:20261112T151653Z
UID:10004057-1795251600-1795280400@cmsa.fas.harvard.edu
SUMMARY:Doing Mathematics with AI Agents
DESCRIPTION:Doing Mathematics with AI Agents \nDate: Saturday\, November 21\, 2026 \nTime: 9:00–5:00 pm ET \nLocation:  Zimmer Hall (Science Center)\, 1 Oxford Street\, Cambridge MA \n  \nThis is a one day workshop for Boston-area mathematics postdocs to work with AI agents in a collaborative environment (designed by Andrew Sutherland) supported by computational infrastructure and formalization tools. \nThis event is appropriate for: \n\nMathematics postdocs who haven’t used AI seriously in their work and want to try\nMathematics postdocs who have only worked with AI in chat in a web browser\nMathematics postdocs who already use Codex or Claude Code\n\nParticipants will work in a system where they can work with multiple agents\, and do mathematics assisted by AI agents during the day of the workshop.  Participants will work with AI agents who are fully set up to do mathematics\, and will talk to other colleagues who are doing the same thing in real time.  The landscape of using AI agents in mathematics is changing incredibly quickly.  At this workshop\, participants can experiment and learn from others about the possibilities and challenges in what is currently available. \nOnly mathematics postdocs are eligible for this event.\nNo funding is available.  We expect participants to be local.\n\nApply here if you are interested to participate.  Space is limited.  Applications will be considered on a rolling basis starting October 30.\n\n\n  \nOrganizers: Melanie Matchett Wood (Harvard)\, Andrew Sutherland (MIT)\, Saman Habibi Esfahani (Harvard CMSA)\, and Michał Szachniewicz (Harvard). \n\n  \n\nThis event is cosponsored by the Harvard Mathematics Department and the CMSA. No financial support is available at this time. \n 
URL:https://cmsa.fas.harvard.edu/event/mathai_112126/
LOCATION:Zimmer Hall (Science Center)\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:MATH+AI,Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261123T163000
DTEND;TZID=America/New_York:20261123T173000
DTSTAMP:20261112T160158Z
CREATED:20260729T200958Z
LAST-MODIFIED:20261112T160158Z
UID:10004034-1795451400-1795455000@cmsa.fas.harvard.edu
SUMMARY:Liouville quantum gravity and distances in random planar maps
DESCRIPTION:Colloquium \nSpeaker: Ewain Gwynne\, University of Chicago \nTitle: Liouville quantum gravity and distances in random planar maps \nAbstract: I will give an introduction to Liouville quantum gravity\, a theory of random surfaces. Such random surfaces describe the large-scale behavior of random planar maps (e.g.\, uniformly sampled triangulations of the sphere)\, equipped with the graph distance\, in the sense of Gromov-Hausdorff convergence. I will also discuss some recent work with J. Borga and others concerning directed distances in random planar maps equipped with an orientation on their edges\, which are related to directed metrics on LQG. I will assume no background knowledge beyond basic probability and analysis. \n  \n  \n  \n\nTo subscribe or unsubscribe to the colloquium mailing list\, please visit this link.
URL:https://cmsa.fas.harvard.edu/event/colloquium-112326/
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/2026/07/CMSA-Colloquium-11.23.2026.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261124T161500
DTEND;TZID=America/New_York:20261124T180000
DTSTAMP:20261001T205203Z
CREATED:20260729T192523Z
LAST-MODIFIED:20261001T205203Z
UID:10003996-1795536900-1795543200@cmsa.fas.harvard.edu
SUMMARY:Geometry and Quantum Theory Seminar
DESCRIPTION:Joint Math/CMSA Geometry and Quantum Theory Seminar \nSpeaker: Yosuke Kubota\, Kyoto University
URL:https://cmsa.fas.harvard.edu/event/quantumgeo_112426/
LOCATION:Science Center 507\, 1 Oxford Street\, Cambridge\, 02138
CATEGORIES:Geometry and Quantum Theory Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261125T140000
DTEND;TZID=America/New_York:20261125T150000
DTSTAMP:20261113T202446Z
CREATED:20260729T194526Z
LAST-MODIFIED:20261113T202446Z
UID:10004018-1795615200-1795618800@cmsa.fas.harvard.edu
SUMMARY:Who Teaches the Teacher? Self-Improving Reasoning Systems
DESCRIPTION:New Technologies in Mathematics Seminar \nSpeaker: Julia Kempe (NYU) \nTitle: Who Teaches the Teacher? Self-Improving Reasoning Systems \nAbstract: AI reasoning has progressed at a startling pace: models have moved from solving competition problems to producing genuinely new mathematics\, including breakthroughs on open questions that have resisted human mathematicians for decades. Mathematics\, however\, has a crucial advantage: progress can be verified. \nIn such domains\, self-improvement increasingly looks possible. Models can explore\, learn from failures\, and even generate curricula for other copies of themselves—creating useful stepping stones beyond what they can currently solve. \nBut verifiable domains may be the easy case. Most of the world provides no theorem checker\, unit test\, or unambiguous reward. What should reasoning—and self-improvement—mean without an external oracle? \nI will discuss recent work on exploration\, teacher–student learning\, and efficient reasoning in mathematical domains\, and then turn to this broader challenge: building systems that learn predictive models of the world\, reason and plan within them\, and improve through the consequences of their interactions with it.
URL:https://cmsa.fas.harvard.edu/event/newtech_112526/
LOCATION:Virtual
CATEGORIES:New Technologies in Mathematics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/2026/07/Copy-of-CMSA-NTM-Seminar-11.4.2026-scaled.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261130T163000
DTEND;TZID=America/New_York:20261130T173000
DTSTAMP:20261102T133025Z
CREATED:20260729T200924Z
LAST-MODIFIED:20261102T133025Z
UID:10004033-1796056200-1796059800@cmsa.fas.harvard.edu
SUMMARY:Snake graphs and q-deformed real numbers
DESCRIPTION:Colloquium \nSpeaker: James Propp (UMass Lowell) \nTitle: Snake graphs and q-deformed real numbers \nAbstract: I’ll present a statistical-mechanical construction of q-deformed real numbers [[x]]_q\, inspired by the q-deformed rational numbers [x]_q of Morier-Genoud and Ovsienko. The new construction admits two equivalent formulations: one in terms of random filters in snake posets and the other in terms of random dimer covers of snake graphs. \nI’ll begin with a combinatorial approach to Stern’s diatomic series and the Calkin–Wilf bijection via finite snake graphs\, and then construct q-deformed rational numbers by introducing an activity parameter q into the model. I extend from q-deformed rationals to q-deformed reals by passing from finite to infinite snake graphs; the main technical step is to show that the associated limiting probability measures are well defined. \nThe resulting q-deformation [[x]]_q satisfies [[x]]_1 = x for all x>0. There’s evidence that\, wherever both [x]_q and [[x]]_q are defined\, [[x]]_q = q [x]_q. For more details\, see arXiv:2607.14332. \n  \n\nTo subscribe or unsubscribe to the colloquium mailing list\, please visit this link.
URL:https://cmsa.fas.harvard.edu/event/colloquium-111626/
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/2026/07/CMSA-Colloquium-11.16.2026.docx-1-scaled.png
END:VEVENT
END:VCALENDAR