School of Mathematics

Drinfeld's lemma for schemes

Kiran Kedlaya
University of California, San Diego; Visiting Professor, School of Mathematics
February 4, 2019
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 result, describe a new approach to it involving a generalization to perfectoid spaces, and mention an application in p-adic Hodge theory (from joint work with Carter and Zabradi).

The Sample Complexity of Multi-Reference Alignment

Philippe Rigollet
Massachusetts Institute of Technology; Visiting Professor, School of Mathematics
February 4, 2019
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 ultimate goal of understanding the sample complexity of Cryo-EM. We describe how this model can be viewed as a multivariate Gaussian mixture model whose centers belong to an orbit of a group of orthogonal transformations.

Near-Optimal Strong Dispersers

Dean Doron
The University of Texas at Austin
February 4, 2019

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. 

Upper bounds for constant slope p-adic families of modular forms

John Bergdall
Bryn Mawr College
January 31, 2019
This talk is concerned with the radius of convergence of p-adic families of modular forms --- q-series over a p-adic disc whose specialization to certain integer points is the q-expansion of a classical Hecke eigenform of level p. Numerical experiments by Gouvêa and Mazur in the nineties predicted the general existence of such families but also suggested, in spirit, the radius of convergence in terms of an initial member. Buzzard and Calegari showed, ten years later, that the Gouvêa--Mazur prediction was false. It has since remained open question how to salvage it.

Analyticity results for the Navier-Stokes Equations

Guher Camliyurt
Member, School of Mathematics
January 31, 2019
We consider the Navier–Stokes equations posed on the half space, with Dirichlet boundary conditions. We give a direct energy based proof for the instantaneous space-time analyticity and Gevrey class regularity of the solutions, uniformly up to the boundary of the half space. We then discuss the adaptation of the same method for bounded domains.

PCP and Delegating Computation: A Love Story.

Yael Tauman Kalai
Microsoft Research
January 28, 2019

In this talk, I will give an overview on how PCPs, combined with cryptographic tools,
are used to generate succinct and efficiently verifiable proofs for the correctness of computations.
I will focus on constructing (computationally sound) *succinct* proofs that are *non-interactive*
(assuming the existence of public parameters) and are *publicly verifiable*.
In particular, I will focus on a recent result with Omer Paneth and Lisa Yang,
where we show how to construct such proofs for all polynomial time computations,