Previous Conferences & Workshops

Determining the complexity of matrix multiplication is a fundamental problem of theoretical computer science. It is popularly conjectured that matrices can be multiplied in nearly-linear time. If true, this conjecture would yield similarly-fast...

Abstract:  Phenomena involving interactions of waves happen at different scales and in different media: from gravitational waves to the waves on the surface of the ocean, from our milk and coffee in the morning to infinitesimal particles that behave...

I will start by introducing and motivating the (two-component) Coulomb gas on the d-dimensional lattice $Z^d$. I will then present some puzzling properties of the fluctuations of this Coulomb gas. The connection of this model with integer-valued...

The successive minima of an order in a degree n number field are n real numbers encoding information about the Euclidean structure of the order. How many orders in degree n number fields are there with almost prescribed successive minima, fixed...

Abstract:  Phenomena involving interactions of waves happen at different scales and in different media: from gravitational waves to the waves on the surface of the ocean, from our milk and coffee in the morning to infinitesimal particles that behave...

Abstract:  Phenomena involving interactions of waves happen at different scales and in different media: from gravitational waves to the waves on the surface of the ocean, from our milk and coffee in the morning to infinitesimal particles that behave...

The inverse theorem for the Gowers U^{s+1}-norms has a central place in modern additive combinatorics, but all known proofs of it are difficult and most do not give effective bounds.

Over this seminar and the next, I will give an outline of a proof...

Finding the smallest integer N=ES_d(n) such that in every configuration of N points in R^d in general position there exist n points in convex position is one of the most classical problems in extremal combinatorics, known as the Erdős-Szekeres...

A Locally Decodable Codes (LDC) is an error correcting code which allows the decoding of a single message symbol from a few queries to a possibly corrupted encoding.  LDCs can be constructed, for example, from low degree polynomials over a finite...