The group of Hamiltonian diffeomorphisms of a symplectic
manifold admits a remarkable bi-invariant metric, called Hofer’s
metric. My talk will be about a recent joint work with Dan
Cristofaro-Gardiner and Vincent Humilière resolving the
following...
Consider the function field F of a smooth curve over FqFq,
with q>2q>2.
L-functions of automorphic representations
of GL(2)GL(2) over FF are important objects for
studying the arithmetic properties of the field FF.
Unfortunately, they can be...
A discrete countable group is matricially stable if its finite
dimensional approximate unitary representations are perturbable to
genuine representations in the point-norm topology. We aim to
explain in accessible terms why matricial stability for a...
This talk introduces a directed analog of the
classical Laplacian matrix and discusses algorithms for
solving certain problems related to them. Of particular interest is
that using such algorithms, one can compute the stationary
distribution of a...
I will survey results related to graph comparison; graph
comparison is a certain type of restriction on a metric spaces
which is encoded by a given graph.
A few months ago, a group of theoretical computer scientists
posted a paper on the Arxiv with the strange-looking title "MIP* =
RE", impacting and surprising not only complexity theory but also
some areas of math and physics. Specifically, it...
I will survey results related to graph comparison; graph
comparison is a certain type of restriction on a metric spaces
which is encoded by a given graph.
A few months ago, a group of theoretical computer scientists
posted a paper on the Arxiv with the strange-looking title "MIP* =
RE", impacting and surprising not only complexity theory but also
some areas of math and physics. Specifically, it...
A subgraph of an edge-coloured graph is called rainbow if all
its edges have distinct colours. The study of rainbow
subgraphs goes back to the work of Euler on Latin squares in the
18th century. Since then rainbow structures were the focus
of...
