(Oxford University)

COURSE_PROPOSAL (12)_2.pdf

The space of unordered tuples. The notion of differentiability and the theory of metric Sobolev in the context of multi-valued functions. Multivalued maximum principle and Holder regularity. Estimates on the Hausdorff dimension of the singular set of Dir-minimizing functions. If time permits: mass minimizing currents and their link with Dir-minimizers. 

COURSE_PROPOSAL (12)_1.pdf

The space of unordered tuples. The notion of differentiability and the theory of metric Sobolev in the context of multi-valued functions. Multivalued maximum principle and Holder regularity. Estimates on the Hausdorff dimension of the singular set of Dir-minimizing functions. If time permits: mass minimizing currents and their link with Dir-minimizers. 

COURSE_PROPOSAL (12)_0.pdf

The space of unordered tuples. The notion of differentiability and the theory of metric Sobolev in the context of multi-valued functions. Multivalued maximum principle and Holder regularity. Estimates on the Hausdorff dimension of the singular set of Dir-minimizing functions. If time permits: mass minimizing currents and their link with Dir-minimizers. 

Associated to any smooth projective curve C is its degree d Jacobian variety, parametrising isomorphism classes of degree d line bundles on C. Letting the curve vary as well, one is led to the universal Jacobian stack. This stack admits several compactifications over the stack of marked stable curves $\overline{\mathcal{M}}_{g,n}$, depending on the choice of a stability condition. In this talk I will introduce these compactified universal Jacobians, and explain how their moduli spaces can be constructed using Geometric Invariant Theory (GIT). This talk is based on arXiv:2210.11457.

The moduli space M of stable bundles on a Riemann surface possesses a natural family of holomorphic trivector fields. The talk will introduce these objects with examples and then use them to gain information about the Hochschild cohomology of M.

I will present two new results. The first concerns minimal surfaces of the hyperbolic space and is a relation between their renormalised area (in the sense of Graham and Witten) and the length of their ideal boundary measured in different metrics of the conformal infinity. The second result concerns minimal submanifolds of the sphere and is a relation between their volume and antipodal-ness. Both results were obtained from the same framework, which involves new monotonicity theorems and a comparison principle for them. If time permits, I will discuss how to use these to answer questions about uniqueness and non-existence of minimal surfaces.

Given a cover U of a family of smooth complex algebraic varieties, we associate with it a class C of structures locally definable in an o-minimal expansion of the reals, containing the cover U.  We prove that the class is ℵ0-homogeneous over submodels and stable. It follows that C is categorical in cardinality ℵ1. In the one-dimensional case we prove that a slight modification of C is an abstract elementary class categorical in all uncountable cardinals.
 

I will talk about homological enumerative invariants for vector bundles on algebraic curves. These invariants were defined by Joyce, and encode rich information about the moduli space of semistable vector bundles, such as its volume and intersection numbers, which were computed by Witten, Jeffrey and Kirwan in previous work. I will define a notion of regularization of divergent infinite sums, and I will express the invariants explicitly as such a divergent sum in a vertex algebra.

We study the problem of determining when a compact group can be realized as the group of isometries of a norm on a finite dimensional real vector space.  This problem turns out to be difficult to solve in full generality, but we manage to understand the connected groups that arise as connected components of isometry groups. The classification we obtain is related to transitive actions on spheres (Borel, Montgomery-Samelson) on the one hand and to prehomogeneous spaces (Vinberg, Sato-Kimura) on the other. (joint work with Martin Liebeck, Assaf Naor and Aluna Rizzoli)

Most algorithms for computing a matrix function $f(A)$ are based on finding a rational (or polynomial) approximant $r(A)≈f(A)$ to the scalar function on the spectrum of $A$. These functions are often in a composite form, that is, $f(z)≈r(z)=r_k(⋯r_2(r_1(z)))$ (where $k$ is the number of compositions, which is often the iteration count, and proportional to the computational cost); this way $r$ is a rational function whose degree grows exponentially in $k$. I will review algorithms that fall into this category and highlight the remarkable power of composite (rational) functions.