Previous Conferences & Workshops

We consider the problem of the list-decodability of error correcting codes. The well-known Johnson bound implies that any code with good distance has good list-decodability, but we do not know many structural conditions on a code which guarantee...

One needs no advanced mathematics to understand Borges' stories, but with some mathematical insight is able to see unexpected and nontrivial connections to rigorous math(s). I shall discuss two of those, one combinatorial, the other analytic, and...

The Goncharov reading group is an informal seminar which will read the paper "Volumes of hyperbolic manifolds and mixed Tate motives" and related materials. We will meet on Wednesdays at 10 am in Simonyi 114.

In this talk we will explain several results surrounding global stability problem for the Boltzmann equation 1872 with the physically important collision kernels derived by Maxwell 1867 for the full range of inverse power intermolecular potentials,...

In joint work with Ballard, Demmel, and Schwartz, we showed the communication cost of algorithms (also known as I/O-complexity) to be closely related to the small-set expansion properties of the corresponding computation graphs. This graph expansion...

The ``k-commodity flow problem'' is: we are given k pairs of vertices of a graph, and we ask whether there are k flows in the graph, where the ith flow is between the ith pair of vertices, and has total value one, and for each edge, the sum of the...