CMSA

Speaker: Daniel Forger (UMich) Location: CMSA building, 20 Garden Street, Room G10 Title: Math, Music and the Mind; Mathematical analysis of the performed Trio Sonatas of J. S. Bach Abstract: I will describe a collaborative project with the University of Michigan Organ Department to perfectly digitize many performances of difficult organ works (the Trio Sonatas by J.S. Bach) by students and faculty […]

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" and output a correct answer with high probability.  However, a longstanding conjecture in theoretical computer science is that every randomized algorithm can be efficiently "derandomized" […]

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 number" of the money is), but which cannot be duplicated, even by somebody with a copy of the quantum state who knows the verification protocol. Several previous proposals have […]

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 a long time horizon. Yet many game-theoretic models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. Here, we show […]

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 without damaging them too much ("gentle measurement"), and how to provide statistical data without leaking too much about individuals ("differential privacy," an area of classical […]

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 task consider a single processor massaging random samples from an unknown source and trying to convert it into a sequence of uniform independent bits.  In […]

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 overview of some results and open questions concerning the conformal bootstrap

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 present how we can use differential algebra and geometry for model identifiability and topological data analysis to study these the wild type dynamics of ERK […]

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.   I will describe a geometric construction of integrable field theories which yields (essentially) all known integrable theories as well as many new ones.  Billiard dynamical […]