Abstract: In this talk, I will present the following application of
microlocal sheaf theory in symplectic topology. For every closed
exact Lagrangian L in the cotangent bundle of a manifold M, we
associate a locally constant sheaf of categories on...
Indistinguishability obfuscation has turned out to be an
outstanding notion with strong implications not only to
cryptography, but also other areas such as complexity theory, and
differential privacy. Nevertheless, our understanding of how
to...
The computational complexity of finding Nash Equilibria in games
has received much attention over the past two decades due to its
theoretical and philosophical significance. This talk will be
centered around the connection between this problem and...
Let $k$ be a fixed positive integer. Myerson (and others) asked
how small the modulus of a non-zero sum of $k$ roots of unity can
be. If the roots of unity have order dividing $N$, then an
elementary argument shows that the modulus decreases at most...
I hope to talk more about how to find generators for Fukaya
categories using symplectic version of the minimal model program in
examples such as symplectic quotients of products of spheres and
moduli spaces of parabolic bundles.
Suppose you have a finite group G and you want to study certain
related structures (e.g., random walks, Cayley graphs, word maps,
etc.). In many cases, this might be done using sums over the
characters of G. A serious obstacle in applying these...
Rank gives a natural filtration on representations of classical
groups. The eta correspondence provides a clean description of a
natural family of representations of a given rank, subject to
certain bounds. There is evidence that this construction...
Invariant theory deals with properties of symmetries - actions
of groups on sets of objects.
It has been slower to join its sibling mathematical theories in
the computer science party, but we now see it more and more in
studies of computational...
Over the past two decades, information theory has reemerged
within computational complexity theory as a mathematical tool for
obtaining unconditional lower bounds in a number of models,
including streaming algorithms, data structures, and...
The problem of constructing error-resilient interactive
protocols was introduced in the seminal works of Schulman (FOCS
1992, STOC 1993). These works show how to convert any two-party
interactive protocol into one that is resilient to constant...
