Previous Conferences & Workshops

The main object of study of this talk are matrices whose entries are linear forms in a set of formal variables (over some field). The main problem is determining if a given such matrix is invertible or singular (over the appropriate field of...

We show that the bipartite perfect matching problem is in $\textrm{quasi-}\textsf{NC}^2$. That is, it has uniform circuits of quasi-polynomial size and $O(\log^2 n)$ depth. Previously, only an exponential upper bound was known on the size of such...

Computer algebra systems are large software systems and as such they have bugs. A recent issue of the Notices of the AMS features the article "The Misfortunes of a Trio of Mathematicians Using Computer Algebra Systems. Can We Trust in Them?" in...

This is joint work with Zhiwei Yun. We prove a generalization of Gross-Zagier formula in the function field setting. Our formula relates self-intersection of certain cycles on the moduli of Shtukas for $\mathrm{GL}(2)$ to higher derivatives of L...

I will describe a formalism for (Lagrangian) Floer theory wherein the output is not a deformation of the cohomology ring, but of the Pontryagin algebra of based loops, or of the analogous algebra of based discs (with boundary on the Lagrangian). I...

This talk will discuss the question: To what extent are the fundamental groups of compact 3-manifolds determined (amongst the fundamental groups of compact 3-manifolds) by their finite quotients. We will discuss work that provides a positive answer...

We will continue Monday's talk on constant-round interactive proofs, going into more details of the full construction and its proof. We will also briefly recap Monday's talk so that it will be beneficial to those who cannot attend on Monday.

The problem of comparing the shapes of different surfaces turns up in different guises in numerous fields. I will discuss a way to put a metric on the space of smooth Riemannian 2-spheres (i.e. shapes) that allows for comparing their geometric...

Interactive proofs have had a dramatic impact on Complexity Theory and Cryptography. In particular, the celebrated IP=PSPACE Theorem [LFKN92,Shamir92] allows an all-powerful but untrusted prover to convince a polynomial-time verifier of the validity...