Previous Conferences & Workshops

Drawing on some recent work, I will try to explain how ideas from derived algebraic geometry shed new light on old constructions in arithmetic geometry, leading ultimately to a better understanding.

This is from joint works with D. Knopf and I. M. Sigal. In this talk I will present a new strategy in studying neckpinching of mean curvature flow. Different from previous results, we do not use backward heat kernel, entropy estimates or subsequent...

(1) My lecture revolves around a question: Does the world embody beautiful ideas? That is a question that people have thought about for a long time. Pythagoras and Plato intuited that the world should embody beautiful ideas; Newton and Maxwell...

The PCP theorem (Arora et. al., J. ACM 45(1,3)) asserts the existence of proofs that can be verified by reading a very small part of the proof. Since the discovery of the theorem, there has been a considerable work on improving the theorem in terms...

A `toy model' for studying the probabilistic distribution of nodal curves of eigenfunctions of linear operators arises from the Laplacian on the standard real 2-torus. Here the eigenvalues are associate to integers m that are sum of two squares...

For all practical purposes, the Micali-Vazirani algorithm, discovered in 1980, is still the most efficient known maximum matching algorithm (for very dense graphs, slight asymptotic improvement can be obtained using fast matrix multiplication)...