Events and Activities

A central goal in complexity theory is to prove separations between randomized and deterministic models of computation. In communication complexity, a key challenge is to establish lower bounds for multiparty protocols in the number-on-forehead (NOF...

We give several constraints on the dissipation measure arising in the inviscid limit of two-dimensional incompressible fluids under minimal assumptions on the initial datum. None of them is replicable in three dimensions, highlighting the non...

As indicated by its name the regulator governs the behavior of objects, such as class numbers, in various settings. Separating it out, "the fusion problem" is a major challenge.

A category of motives is an axiomatic framework in which several cohomology theories from algebraic geometry are represented. While Morel and Voevodsky's classical framework of motivic homotopy theory focused on $A^1$-invariant cohomology theories...

TBA

The conformal bootstrap has proven very powerful for analyzing reflection-positive conformal models. In my talk, I will review this method and suggest a way to generalize it beyond the reflection-positive case, drawing inspiration from the spectral...

Locally Decodable Codes (LDCs) are a special type of error correcting codes which are constructed from finite point sets that support many small linear dependencies (e.g. many collinear triples). Despite their importance, there are still huge gaps...