Video Lectures

The notion of exactly (or approximately) representing certain combinatorial properties of a graph $G$ on a simpler graph is ubiquitous in combinatorial optimization. In this talk, I will introduce the notion of vertex sparsification. Here we are...

American composer and lyricist Stephen Sondheim talks about his life and work in a conversation with Derek Bermel, the Institute’s Artist-in-Residence. Sondheim, whose works for Broadway include A Funny Thing Happened on the Way to the Forum, Comp...

I will describe the notions of strong and weak epsilon nets in range spaces, and explain briefly some of their many applications in Discrete Geometry and Combinatorics, focusing on several recent results in the investigation of the extremal...

A long-standing line of work in economic theory has studied models by which a group of people in a social network, each holding a numerical opinion, can arrive at a shared opinion through repeated averaging with their neighbors in the network...

Listen to pianist Timothy Andres discuss music with Derek Bermel, Institute Artist-in-Residence.

Lecture 4: Integral Coefficients; Application to Birational Invariants

Lecture 3: Decomposition of the Small Diagonal and the Topology of Families