Events and Activities

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

May
21
2026

WAM 2026

On Superorthogonality
Lillian Pierce
5:00pm|Simonyi Hall 101

Abstract: How do we check if two vectors are orthogonal? We compute their dot product, which by definition takes two vectors as inputs. How do we check if two functions are orthogonal? We compute their inner product, which by definition takes two...

May
22
2026

WAM 2026

From Fourier Restriction to Number Theory, Combinatorics, and Fractal Geometry
Dominique Maldague
9:30am|Simonyi Hall 101

Abstract: Fourier series are classically used to construct solutions to partial differential equations such as the wave and Schrödinger equations. In Fourier restriction theory, additional conditions are imposed on the frequencies of these series...

May
22
2026

WAM 2026

What KdV Teaches us About Waves
Monica Visan
11:00am|Simonyi Hall 101

Abstract: In this course, we will use the Korteweg-de Vries equation as a model to understand the behavior of dispersive partial differential equations. Through this lens, we will discuss dispersion, well-posedness, and solitons.  We will also...

May
26
2026

Computer Science/Discrete Mathematics Seminar II

An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC Learning
10:30am|Simonyi 101 and Remote Access

I will describe recent breakthrough results in multiclass PAC learning that characterize the optimal sample complexity. The talk will discuss recent work of Chirag Pabbaraju, as well as work of Steve Hanneke, Qinglin Meng, Shay Moran, and Amirreza...

May
26
2026

Computer Science/Discrete Mathematics Seminar II

An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC Learning
10:30am|Simonyi 101 and Remote Access

I will describe recent breakthrough results in multiclass PAC learning that characterize the optimal sample complexity. The talk will discuss recent work of Chirag Pabbaraju, as well as work of Steve Hanneke, Qinglin Meng, Shay Moran, and Amirreza...

Jun
01
2026

Computer Science/Discrete Mathematics Seminar I

Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR
Jarosław Błasiok
11:00am|Simonyi Hall 101 and Remote Access

In the noisy $k$-XOR problem, one is given $y \in \bF_2^\constraints$ and must distinguish between $y$ uniform and $y = A x + e$, where $A$ is the adjacency matrix of a $k$-left-regular bipartite graph with variables and constraints, $x\in \bF_2^...

Jun
01
2026

Computer Science/Discrete Mathematics Seminar I

Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR
Jarosław Błasiok
11:00am|Simonyi Hall 101 and Remote Access

In the noisy $k$-XOR problem, one is given $y \in \bF_2^\constraints$ and must distinguish between $y$ uniform and $y = A x + e$, where $A$ is the adjacency matrix of a $k$-left-regular bipartite graph with variables and constraints, $x\in \bF_2^...