Previous Conferences & Workshops

The PCP Theorem states that any mathematical proof can be encoded in a way that allows verifying it probabilistically while reading only a small number of bits of the (new) proof. This result has several applications in Theoretical Computer Science...

For an immersed minimal surface in $R^3$, we show that there exists a lower bound on its Morse index that depends on the genus and number of ends, counting multiplicity. This improves, in several ways, an estimate we previously obtained bounding the...

I will show that a closed, negatively curved Riemannian manifold of 1/4 pinched negative curvature has constant negative curvature if and only if the Lyapunov spectrum of its geodesic flow is the same as that of a hyperbolic manifold. The Lyapunov...

It is fundamental to understand a manifold with positive scalar curvature and its topology. The minimal surface approach pioneered by R. Schoen and S.T. Yau have advanced our understanding of positively curved manifolds. A very important result is...

A linear matrix is a matrix whose entries are linear forms in some indeterminates $t_1,\dots, t_m$ with coefficients in some field $F$. The commutative rank of a linear matrix is obtained by interpreting it as a matrix with entries in the function...

In the course of constructing the Langlands correspondence for GL(2) over a function field, Drinfeld discovered a surprising fact about the interaction between étale fundamental groups and products of schemes in characteristic p. We state this...

I'll outline the construction of an invariant for knots in homology 3-spheres which can be thought of as an SL(2,C) analog of Kronheimer and Mrowka's singular knot instanton homology. This invariant is similar to an invariant of 3-manifolds...

How should one estimate a signal, given only access to noisy versions of the signal corrupted by unknown cyclic shifts? This simple problem has surprisingly broad applications, in fields from aircraft radar imaging to structural biology with the...

Randomness dispersers are an important tool in the theory of pseudorandomness, with numerous applications. In this talk, we will consider one-bit strong dispersers and show their connection to erasure list-decodable codes and Ramsey graphs.

The...