Previous Conferences & Workshops

Can we reconstruct a function by knowing only a subset of its values and a subset of the values of the function's Fourier transform?
How many values do we need to know for such a reconstruction? Can we interpolate a given subset of values? What are...

I will give an introduction to the problem of sampling from a strongly log-concave density on Euclidean space through the lens of convex optimization.  In particular, I will focus on the interpretation, due to Jordan, Kinderlehrer, and Otto, of the...

Quasi-coherent sheaves cannot support a six-functor formalism in the same way that e.g. \ell-adic sheaves do. Clausen and Scholze have shown that this can be fixed by extending the category of quasi-coherent sheaves to `solid sheaves’. In this talk...

The finite field Kakeya problem asks about the size of the smallest set in (F_q)^n containing a line in every direction.  Raised by Wolff in 1999 as a ‘toy’ version of the Euclidean Kakeya conjecture, this problem is now completely resolved using...

In 1948, Shannon used a probabilistic argument to show the existence of codes achieving channel capacity. In 1954, Muller and Reed introduced a simple deterministic code construction, conjectured shortly after to achieve channel capacity. Major...

Submanifolds with intrinsic Lipschitz regularity in Carnot groups (i.e.,
stratified groups endowed with a sub-Riemannian structure) can be
introduced using the theory of intrinsic Lipschitz graphs started years
ago by B. Franchi, R. Serapioni and F...