Video Lectures

One of the central problems of coding theory is to determine the trade-off between the amount of information a code can carry (captured by its rate) and its robustness to resist message corruption (captured by its distance). One of the main methods...

Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas.  In 2006, Kahn and Kalai conjectured that for any nontrivial increasing property on a finite set, its threshold is...

Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas.  In 2006, Kahn and Kalai conjectured that for any nontrivial increasing property on a finite set, its threshold is...

I will discuss the difficult problem of proving reasonable bounds in the multidimensional generalization of Szemer\’edi’s theorem and describe a proof of such bounds for sets lacking nontrivial configurations of the form $(x,y), (x,y+z), (x,y+2z),...

Following the collision of two compact objects, an accretion disk forms and from it matter is ejected that sources the universe's heavy elements and that is observable as a kilonova. The amount of ejecta, the types of elements that form, and the...

We will discuss the price of the quantum error correcting codes, defined as the number of physical qubits needed to reconstruct whether a given operator has been acted upon the thermal state or not. By thinking about reconstruction via quantum...

We will discuss some old and new results concerning the long-time behavior of solutions to the two-dimensional incompressible Euler equations.  Specifically, we discuss whether steady states can be isolated, wandering for solutions starting nearby...

One of the central problems of coding theory is to determine the trade-off between the amount of information a code can carry (captured by its rate) and its robustness to resist message corruption (captured by its distance). On the existential side...

Understanding the behavior of multi-player (multi-prover) games under parallel repetition is an important problem in theoretical computer science.

In a k-player game G, a referee chooses questions (x1,...,xk) from a (publicly known) distribution...

Modern theoretical investigations into the nature of spacetime are revealing that quantum entanglement plays a crucial role for resolving several long standing puzzles. Black holes have been central to these investigations. Quantum models for black...