A Lagrangian correspondence is a Lagrangian submanifold in the
product of two symplectic manifolds. This generalizes the notion of
a symplectomorphism and was introduced by Weinstein in an attempt
to build a symplectic category. In joint work with...
A pseudo-random graph is a graph G resembling a typical random
graph of the same edge density. Pseudo-random graphs are expected
naturally to share many properties of their random counterparts. In
particular, many of their enumerative properties...
A. Ghosh and P. Sarnak have recently initiated the study of
so-called real zeros of holomorphic Hecke cusp forms, that is zeros
on certain geodesic segments on which the cusp form (or a multiple
of it) takes real values. In the talk I'll first...
We present a unified approach to various topics in mathematics
including: Ergodic theory, graph limit theory, hypergraph
regularity, and Higher order Fourier analysis. The main theme is
that very large complicated structures can be treated as...
Proving superpolylogarithmic lower bounds for dynamic data
structures has remained an open problem despite years of research.
Recently, Patrascu proposed an exciting new approach for breaking
this barrier via a two player communication model in...
