Previous Conferences & Workshops

Many of the central problems in computational complexity revolve around proving lower bounds on the amount of resources used in various computational models. In this series of talks, we will discuss three standard objects in computational complexity...

Flocking and swarming models which seek to explain pattern formation in mathematical biology often assume that organisms interact through a force which is attractive over large distances yet repulsive at short distances. Suppose this force is given...

The number of embedded pseudo-holomorphic curves in a symplectic manifold typically depends on the choice of an almost complex structure on the manifold and so does not lead to a symplectic invariant. However, I will discuss two instances in which...

The purpose of this talk is to introduce the classification problem of partially hyperbolic diffeomorphisms in dimension 3 (including introducing the concept of partially hyperbolic diffeomorphisms and its relevance). The main goal will be to...

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...