Events and Activities

Explore current and upcoming events and activities happening at the Institute for Advanced Study.

Oct
12
2026

Computer Science/Discrete Mathematics Seminar I

Random Walk and Paint Blending
Peter Winkler
11:00am|Simonyi 101 and Remote Access

Random walks on a graph, and Markov chains in general, provide endless fascination and myriad applications (for example, in sampling and approximation algorithms.)  A nearly trivial but endlessly useful tool in this theory is the "harmonic lemma for...

Oct
12
2026

IAS CMP/QFT Group Meeting

On the Classification of c=1 Conformal Field Theories
11:00am|Bloomberg Lecture Hall (IAS)

Abstract: Nearly 40 years ago, Ginsparg painted a conjectural picture of the conformal moduli space of unitary 2D conformal field theories (CFTs) with compact spectrum and central charge c=1. I will present, in physical language, a mathematically...

Oct
12
2026

Princeton University LFTP Seminar

Gravitational Tidal Matching: a Scattering Amplitudes approach to Love Numbers
Giulia Isabella
12:30pm|Jadwin Hall, 4th Floor, LFPT Space

Abstract: At wavelengths large compared to the size of the source, any compact object admits a point-particle description, with finite-size corrections encoded by Love numbers. In this talk, I will discuss a novel method for computing gravitational...

Oct
12
2026

Ruth and Irving Adler Expository Lecture in Mathematics

Probability and Intuition
Peter Winkler
3:00pm|Simonyi 101

Even mathematicians make most of their daily decisions without mathematical help, guided by reasoning and intuition that are usually reliable. But now and then our intuition will lead us off the rails. Can we tell when this is liable to happen, and...

Oct
12
2026

Joint IAS/PU Arithmetic Geometry

Integral Structures of the Gauss--Manin Connection
Haoyang Guo
3:30pm|Princeton University, Fine Hall 224

Given a proper smooth family of algebraic varieties, its Gauss--Manin connections are fundamental invariants that encode the algebraic/differential information of this family. When the varieties are defined over a $p$-adic local field and the family...

Oct
13
2026

Computer Science/Discrete Mathematics Seminar II

Top-Down Lower Bounds for Bounded Depth Circuits
10:30am|Simonyi Hall 101 and Remote Access

A cornerstone result in complexity theory is that O(1)-depth circuits with unbounded fan-in AND/OR gates computing the parity of an n bit string must have exp(n) size. Two completely different proofs of this are known, both dating back to the 1980's...