Optimal transport theory is a natural way to define both a distance and a geometry on the space of probability measures. In settings like graphical causal models (also called Bayes networks or belief networks), the space of probability measures is enriched by an information structure modeled by a directed graph. This talk introduces a variant of optimal transport including such a graphical information structure. The goal is to provide a concept of optimal transport whose topological and geometric properties are well suited for structural causal models. In this regard, we show that the resulting concept of Wasserstein distance can be used to control the difference between average treatment effects under different distributions, and is geometrically suitable to interpolate between different structural causal models.

The compatibility of local and global Langlands correspondences is a central problem in algebraic number theory. A possible approach to resolving it relies on the existence of global Galois representations with prescribed local monodromy.  I will provide a partial solution by relating the question to its topological analogue. Both the topological and arithmetic version can be solved using the same family of projective hypersurfaces, which was first studied by Dwork.

The classical finite element method uses piecewise-polynomial function spaces satisfying continuity and boundary conditions. Hybrid finite element methods, by contrast, drop these continuity and boundary conditions from the function spaces and instead enforce them weakly using Lagrange multipliers. The hybrid approach has several numerical and implementational advantages, which have been studied over the last few decades.

In this talk, we show how the hybrid perspective has yielded new insights—and new methods—in structure-preserving numerical PDEs. These include multisymplectic methods for Hamiltonian PDEs, charge-conserving methods for the Maxwell and Yang-Mills equations, and hybrid methods in finite element exterior calculus.