Previous Conferences & Workshops

In the optimal transport problem, it is well-known that the geometry of the target domain plays a crucial role in the regularity of the optimal transport. In the quadratic cost case, for instance, Caffarelli showed that having a convex target domain...

I'll show a graphical user interface I wrote which explores the problem of inscribing rectangles in Jordan loops. The motivation behind this is the notorious Square Peg Conjecture of Toeplitz, from 1911.I did not manage to solve this problem, but I...

A fundamental task in (unsupervised) analysis of data is to detect and estimate interesting "structure" hidden in it. In low dimensions, this task has been explored for over 100 years with dozens of developed methods. In this talk I'll focus on...

The choiceless computation model of Blass, Gurevich and Shelah (1999, 2002) is an algorithmic framework for computing isomorphism-invariant properties of unordered structures. Machines in this model have the power of parallel execution, but lack the...

In this talk, I'm going to explain my recent work with Steve Zelditch, where we prove that, when $M$ is a principle $S^1$-bundle equipped with a generic Kaluza-Klein metric, the nodal counting of eigenfunctions is typically $2$, independent of the...

We consider Laplace eigenfunctions of a metric graph satisfying Neumann-Kirchhoff conditions on every vertex. The nodal count of a given eigenfunction is the number of points at which it vanishes. The nodal count of the n-th eigenfunction was shown...

We consider a locally finite (Radon) measure on SO(d,1)/Gamma invariant under a horospherical subgroup of SO(d,1) where Gamma is a discrete, but not necessarily geometrically finite, subgroup. We show that whenever the measure does not observe any...

This talk is about qualitative properties of the underlying scheme of Rapoport-Zink formal moduli spaces of p-divisible groups, resp. Shtukas. We single out those cases when the dimension of this underlying scheme is zero, resp. those where the...