Previous Conferences & Workshops
Full Regularity for the Dissipative Quasi-Geostrophic Equations
We will present some recent developments in the
quasi-geostrophic equations. We show that local solutions to
critical and super-critical dissipative quasi-geostrophic equations
have higher regularity, although one gets lower derivative in
the...
On Stability Conditions, Donaldson-Thomas Invariants and Cluster Algebras
M. Kontsevich
Algebraic Property Testing - Part II
A Property P of functions is said to be locally testable if
there exists a probabilistic algorithm that makes few (constant)
queries for the value of f and accepts those satisfying P while
rejecting functions that are far from any function...
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced
bipartite expander graphs with expansion arbitrarily close to the
degree (which is polylogarithmic in the number of vertices). Both
the degree and the number of right-hand vertices are...
Optimal Transport and Geometric Inequalities
Since the end of the nineties, the relations of optimal
transport with many functional inequalities with geometric content
has been revealed and explored by several authors (Barthe,
Caffarelli, Cordero, McCann, Otto and others). Sobolev
inequalities...
The Syntomic Regulator for K_1 of Surfaces
We give an explicit formula for the syntomic regulator of
certain elements in the first algebraic K-theory group of a smooth
complete surface over the ring of integers of a p-adic field. The
formula uses the theory of Coleman integration and the...
Fast Johnson-Lindenstrauss Transform(s)
A classic functional analytic result by Johnson and
Lindenstrauss from 1984 implies that any Euclidean metric on n
points can be represented using only k=(log n)/epsilon^2 dimensions
with distortion epsilon. In computer science, this result has
been...
Biased Positional Games and Thin Hypergraphs with Large Covers
We consider biased positional games, played on the edge set of a
complete graph Kn on n vertices. These games are played by two
players, called Maker and Breaker, who take turns in claiming
previously unoccupied edges of Kn. Maker claims a single...
Rankin-Selberg Without Unfolding and Gelfand Pairs
A. Reznikov
4:30pm|Fine Hall 322, Princeton University
I describe a new simple way to obtain Rankin-Selberg type
spectral identities. These include the classical Rankin-Selberg
identity, the Motohashi identity for the forth moment of the zeta
function and many new identities between various L-functions...
Random Conformal Snowflakes
In this talk we introduce a new class of random fractals which
we call conformal snowflakes. We study fine structure of harmonic
measure on theses snowflakes. It turns out that in this case the
multifractal spectrum of harmonic measure is related to...