Previous Conferences & Workshops

Abstract: 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),...

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 $(x^{1}, ..., x^{k})$ from a (publicly known)...

In this three-part lecture series, we will present a series of works by Bedrossian, Blumenthal and Punshon-Smith on the chaotic mixing and enhanced dissipation properties of a passive tracer subject to the motion of an ergodic Markovian flow of...

Undergraduate mathematicians are taught Hilbert's dream that theorems should be built up from a solid axiomatic base, and that the whole structure of mathematics is (or should be) a solid verifiable whole. However, this is rather far from how...