Events and Activities

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

Feb
09
2026

Computer Science/Discrete Mathematics Seminar I

Upper and Lower Bounds for the Linear Ordering Principle
Ilya Volkovich
11:00am|Simonyi Hall 101 and Remote Access

The Linear Ordering Principle (LOP) is a total search problem that generalizes the task of finding the minimum element of a given order to settings in which the order need not be total. Building on this, Korten and Pitassi (FOCS 2024) introduced the...

Feb
10
2026

Computer Science/Discrete Mathematics Seminar II

A Complexity Lower Bound on Algebra Isomorphisms
Jeongwan Haah
10:30am|Simonyi 101 and Remote Access

Two vector spaces of the same finite dimension are related by a linear isomorphism; that’s how the dimension is defined. Similarly, two simple subalgebras over complex numbers that are closed under conjugate transpose are related by a unitary...

Mar
02
2026

Computer Science/Discrete Mathematics Seminar I

Color-avoiding Paths
Yuval Wigderson
11:00am|Simonyi Hall 101 and Remote Access

The very first result ever proved about tournaments is due to Rédei, who nearly 100 years ago proved that every tournament contains a Hamiltonian directed path. Since then, questions and results about directed paths in tournaments have become a...

Mar
03
2026

Computer Science/Discrete Mathematics Seminar II

VC Dimensions and Regularity
Yuval Wigderson
10:30am|Simonyi 101 and Remote Access

The regularity lemma says that every discrete object can be partitioned into a small number of random-like subobjects. But how small is small? And can we make small smaller if we assume that our given object is simple? And what does it mean for a...