School of Mathematics

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,

(Non)uniqueness questions in mean curvature flow

Lu Wang
University of Wisconsin–Madison; Member, School of Mathematics
January 22, 2019

Mean curvature flow is the negative gradient flow of the
volume functional which decreases the volume of (hyper)surfaces in the
steepest way. Starting from any closed surface, the flow exists
uniquely for a short period of time, but always develops singularities
in finite time. In this talk, we discuss some non-uniqueness problems
of the mean curvature flow passing through singularities. The talk is
mainly prepared for non-specialists of geometric flows.

Symplectic methods for sharp systolic inequalities

Umberto Hryniewicz
Universidade Federal do Rio de Janeiro; Member, School of Mathematics
January 22, 2019

In this talk I would like to explain how methods from
symplectic geometry can be used to obtain sharp systolic inequalities.
I will focus on two applications. The first is the proof of a
conjecture due to Babenko-Balacheff on the local systolic maximality
of the round 2-sphere. The second is the proof of a perturbative
version of Viterbo's conjecture on the systolic ratio of convex energy
levels. If time permits I will also explain how to show that general
systolic inequalities do not exist in contact geometry. Joint work

New Results on Projections

Guy Moshkovitz
Member, School of Mathematics
January 22, 2019

What is the largest number of projections onto k coordinates guaranteed in every family of m binary vectors of length n? This fundamental question is intimately connected to important topics and results in combinatorics and computer science (Turan number, Sauer-Shelah Lemma, Kahn-Kalai-Linial Theorem, and more), and is wide open for most settings of the parameters. We essentially settle the question for linear k and sub-exponential m. 

Based on joint work with Noga Alon and Noam Solomon.

Regularity of weakly stable codimension 1 CMC varifolds

Neshan Wickramasekera
University of Cambridge; Member, School of Mathematics
January 15, 2019
The lecture will discuss recent joint work with C. Bellettini and O. Chodosh. The work taken together establishes sharp regularity conclusions, compactness and curvature estimates for any family of codimension 1 integral $n$-varifolds satisfying: (i) locally uniform mass and $L^{p}$ mean curvature bounds for some $p > n;$ (ii) two structural conditions and (iii) two variational hypotheses on the orientable regular parts, namely, stationarity and (weak) stability with respect to the area functional for volume preserving deformations (supported on the regular parts).

Distribution of the integral points on quadrics

Naser Talebi Zadeh Sardari
University of Wisconsin Madison
January 9, 2019
Motivated by questions in computer science, we consider the problem of approximating local points (real or p-adic points) on the unit sphere S^d optimally by the projection of the integral points lying on R*S^d, where R^2 is an integer. We present our numerical results which show the diophantine exponent of local point on the sphere is inside the interval [1, 2-2/d]. By using the Kloosterman's circle method, we show that the diophantine exponent is less than 2-2/d for every d>3.