Previous Conferences & Workshops

We will survey general definitions and facts about ultrafilters, and how the algebraic operations on the integers extend to the space of ultrafilters. We will also discuss some applications in combinatorial number theory and ergodic theory.

The recently-discoverd Hypergraph Container Method (Saxton and Thomason, Balogh, Morris and Samotij), generalizing an earlier version for graphs (Kleitman and Winston), is used extensively in recent years in extremal and probabilistic combinatroics...

The theory of "random surfaces" has emerged in recent decades as a significant field of mathematics, lying somehow at the interface between geometry, probability, and mathematical physics. I will give a friendly (I hope) colloquium-level overview of...

Sampling from high-dimensional, multimodal distributions is a computationally challenging and fundamental task.  This talk will focus on a family of random instances of such problems described by random quadratic potentials on the hypercube known as...

If a set of integers is syndetic (finitely many translates cover the integers), must it contain two integers whose ratio is a square?  No one knows.  In the broader context of the disjointness between additive and multiplicative configurations and...

A powerful technique developed and extended in the past decade in communication complexity is the so-called "lifting theorems."  The idea is to translate the hardness results from "easier" models, e.g., query complexity, polynomial degrees, to the...