Spacetime, Quantum Mechanics and Positive Geometry at Infinity
Speaker: Nima Arkani-Hamed (IAS) Title: Spacetime, Quantum Mechanics and Positive Geometry at Infinity
12 events found.
During the 2026–27 academic year, the CMSA will be hosting a Colloquium series, organized by Tobias Schmidt, Houcine Ben Dali, Francesco Mori, and Michal Shavit.
It will take place on Mondays from 4:30 – 5:30 pm (Eastern Time) in Room G10, CMSA, 20 Garden Street. All CMSA postdocs/members are required to attend the weekly CMSA Colloquium series as well as the weekly CMSA Members’ Seminars.
To subscribe to the CMSA Colloquium Mailing list, please visit this link.
The schedule will be updated as talks are confirmed.
A unified perspective on integrability
Speaker: Kevin Costello (Perimeter Institute) Title: A unified perspective on integrability Abstract: Two-dimensional integrable field theories, and the integrable PDEs which are their classical limits, play an important role in mathematics and physics. […]
Algebra, Geometry and Topology of ERK Enzyme Kinetics
Speaker: Heather Harrington (University of Oxford) Title: Algebra, Geometry and Topology of ERK Enzyme Kinetics Abstract: In this talk I will analyse ERK time course data by developing mathematical models of enzyme kinetics. I will […]
An Introduction to the Non-Perturbative Bootstrap
Speaker: Xi Yin (Harvard) Title: An Introduction to the Non-Perturbative Bootstrap Abstract: I will discuss non-perturbative definitions of quantum field theories, some properties of correlation functions of local operators, and give a brief […]
Communication Complexity of Randomness Manipulation
Speaker: Madhu Sudan (Harvard) Title: Communication Complexity of Randomness Manipulation Abstract: The task of manipulating randomness has been a subject of intense investigation in the theory of computer science. The classical definition of this […]
Emergence of graviton-like excitations from a lattice model
Speaker: Xiao-Gang Wen (MIT) Title: Emergence of graviton-like excitations from a lattice model Abstract: I will review some construction of lattice rotor model which give rise to emergent photons and graviton-like excitations. The appearance of […]
Data-intensive Innovation and the State: Evidence from AI Firms in China
Speaker: David Yang (Harvard) Title: Data-intensive Innovation and the State: Evidence from AI Firms in China Abstract: Data-intensive technologies such as AI may reshape the modern world. We propose that two features of data interact to shape innovation in data-intensive economies: first, states are […]
Gentle Measurement of Quantum States and Differential Privacy
Speaker: Scott Aaronson (University of Texas at Austin) Title: Gentle Measurement of Quantum States and Differential Privacy Abstract: I'll discuss a recent connection between two seemingly unrelated problems: how to measure a collection of quantum states […]
A Compact, Logical Approach to Large-Market Analysis
Speaker: Scott Duke Kominers (Harvard) Title: A Compact, Logical Approach to Large-Market Analysis Abstract: In game theory, we often use infinite models to represent "limit" settings, such as markets with a large number of agents or games with […]
The Cubical Route to Understanding Groups
Speaker: Daniel Wise (McGill University) Title: The Cubical Route to Understanding Groups Abstract: Cube complexes have come to play an increasingly central role within geometric group theory, as their connection to right-angled Artin groups provides a powerful […]
Quantum Money from Lattices
Speaker: Peter Shor (MIT) Title: Quantum Money from Lattices Abstract: Quantum money is a cryptographic protocol for quantum computers. A quantum money protocol consists of a quantum state which can be created (by the mint) and verified (by anybody with a quantum computer who knows what the "serial […]
Derandomizing Algorithms via Spectral Graph Theory
Speaker: Salil Vadhan (Harvard) Title: Derandomizing Algorithms via Spectral Graph Theory Abstract: Randomization is a powerful tool for algorithms; it is often easier to design efficient algorithms if we allow the algorithms to "toss coins" […]