Previous Conferences & Workshops
A Gelfand-Graev Formula and Stable Transfer Factors for $mathrm{SL}_n$
Daniel Johnstone
A result of Gelfand and Graev shows that the supercuspidal
representations of $\mathrm{SL}_2$ are neatly parameterized by
characters of elliptic tori, and that the stable character data for
all such representations may be collected into a single...
Voevodsky's Univalent Foundations for mathematics
Daniel Grayson
We'll take a glance at the world of mathematics as viewed
through the Univalent Foundations of Voevodsky. In it, "set" and
"proposition" are defined in terms of something more fundamental:
"type". The formal language fulfills the mathematicians'...
Large coupling asymptotics for the Lyapunov exponent of quasi-periodic Schrödinger operators with analytic potentials
Christoph Marx
In this talk we will quantify the coupling asymptotics for the
Lyapunov exponent (LE) of a one-frequency quasi-periodic
Schrödinger operator with analytic potential sampling function. By
proving an asymptotic formula for the LE valid for all...
Reinforced random walks and statistical physics
Pierre Tarres
We explain how the Edge-reinforced random walk, introduced by
Coppersmith and Diaconis in 1986, is related to several models in
statistical physics, namely the supersymmetric hyperbolic sigma
model studied by Disertori, Spencer and Zirnbauer (2010)...
The sensitivity conjecture is a famous open problem in the
theory of boolean functions. Let $f$ be a boolean function defined
on the hypercube. The sensitivity of a node $x$ is the number of
its neighbours in the hypercube, for which $f$ give the...
Combinatorics of the amplituhedron
The tree amplituhedron $A(n,k,m)$ is the image in the
Grassmannian $Gr(k,k+m)$ of the totally nonnegative part of
$Gr(k,n)$, under a (map induced by a) linear map which is totally
positive. It was introduced by Arkani-Hamed and Trnka in 2013
in...
Active learning with \"simple\" membership queries
An active learning algorithm for a classification problem has
access to many unlabelled samples. The algorithm asks for the
labels of a small number of samples, carefully chosen, such that
that it can leverage this information to correctly label...
Constructible sheaves in mirror symmetry
I will survey the coherent-constructible correspondence of
Bondal, which embeds the derived category of coherent sheaves on a
toric variety into the derived category of constructible sheaves on
a compact torus. The tools of the first lecture turn...
Constructible sheaves in symplectic topology
I will give an introduction to the microlocal theory of sheaves
after Kashiwara and Schapira, and some of its recent applications
in symplectic topology. I'll start with the basics, but target
applications for the 75 minutes are Tamarkin's proof of...
