Previous Conferences & Workshops

MIP* (pronounced “M-I-P star”) denotes the class of problems that admit interactive proofs with quantum entangled provers. It has been an outstanding question to characterize the complexity of MIP*. Most notably, there was no known computable upper...

We will discuss how to study the cubic moment of any family of automorphic L-functions on PGL(2) using regularized diagonal periods of Eisenstein series, following a strategy suggested by Michel--Venkatesh. Applications include generalizations to...

I’ll discuss the Noisy Quadratic Model, the toy problem of minimizing a convex quadratic function with noisy gradient observations. While the NQM is simple enough to have closed-form dynamics for a variety of optimizers, it gives a surprising amount...

A pseudodeterministic algorithm for a search problem (introduced by Goldwasser and Gat) is a randomized algorithm that must output the *same* correct answer with high probability over all choices of randomness. In this talk I will give several...

Symplectic embedding problems are at the core of symplectic topology. Many results have been found involving balls, ellipsoids and polydisks. More recently, there has been progress on problems involving lagrangian products and related domains. In...

We give the first examples of codimension-1 knotting in the 4-sphere, i.e. there is a 3-ball B1 with boundary the standard linear 2-sphere, which is not isotopic rel boundary to the standard linear 3-ball B0. Actually, there is an infinite family of...

Randomness can provide an exponential saving in the amount of communication needed to solve a distributed problem, and the canonical example of this is the equality function. However, in many examples where randomness helps, having an efficient way...

The Grothendieck group of varieties over a field k is the quotient of the free abelian group of isomorphism classes of varieties over k by the so-called cut-and-paste relations. It moreover has a ring structure coming from the product of varieties...