The aim of this talk is to describe the classification problem for Higgs bundles and to explain how a combination of classical and Non-Reductive Geometric Invariant Theory might be used to solve this classification problem.
 
I will start by defining Higgs bundles and their physical origins. Then, I will present the classification problem for Higgs bundles. This will involve introducing the "stack" of Higgs bundles, a purely formal object which allows us to consider all isomorphism classes of Higgs bundles at once. Finally, I will explain how the stack of Higgs bundles can be described geometrically. As we will see, the stack of Higgs bundles can be decomposed into disjoint strata, each consisting of Higgs bundles of a given "instability type". Both classical and Non-Reductive GIT can then be applied to obtain moduli spaces for each of the strata.

In a recent preprint, Basterra, Bobkova, Ponto, Tillmann and Yeakel
defined operads with homological stability (OHS) and showed that after
group-completion, algebras over an OHS group-complete to infinite loop
spaces. This can in particular be used to put a new infinite loop space
structure on stable moduli spaces of high-dimensional manifolds in the
sense of Galatius and Randal-Williams, which are known to be infinite
loop spaces by a different method.

To complicate matters further, I shall introduce a mild strengthening of
the OHS condition and construct yet another infinite loop space
structure on these stable moduli spaces. This structure turns out to be
equivalent to that constructed by Basterra et al. It is believed that
the infinite loop space structure due to Galatius--Randal-Williams is
also equivalent to these two structures.

In this talk I will discuss the problem of finding Einstein metrics in the homogeneous and cohomogeneity one setting. 
In particular, I will describe a recent result concerning existence of solutions to the Dirichlet problem for cohomogeneity one Einstein metrics.

The theory of metric measure spaces with Ricci curvature from below is growing very quickly, both in the "Riemannian" class RCD and the general  CD one. I will review some of the most recent results, by illustrating the key identification results and technical tools (at the level of calculus in metric measure spaces) underlying these results.
 

I will present a gentle introduction to the theory of conformal dimension, focusing on its applications to the boundaries of hyperbolic groups, and the difficulty of classifying groups whose boundaries have conformal dimension 1.

I will introduce a McKean—Vlasov problem arising from a simple mean-field model of interacting neurons. The equation is nonlinear and captures the positive feedback effect of neurons spiking. This leads to a phase transition in the regularity of the solution: if the interaction is too strong, then the system exhibits blow-up. We will cover the mathematical challenges in defining, constructing and proving uniqueness of solutions, as well as explaining the connection to PDEs, integral equations and mathematical finance.

In this talk we introduce a novel dynamic programming (DP) approximation that exploits the inherent network structure present in revenue management problems. In particular, our approximation provides a new lower bound on the value function for the DP, which enables conservative revenue forecasts to be made. Existing state of the art approximations of the revenue management DP neglect the network structure, apportioning the prices of each product, whereas our proposed method does not: we partition the network of products into clusters by apportioning the capacities of resources. Our proposed approach allows, in principle, for better approximations of the DP to be made than the decomposition methods currently implemented in industry and we see it as an important stepping stone towards better approximate DP methods in practice.

One of the key challenges in revenue management is unconstraining demand data. Existing state of the art single-class unconstraining methods make restrictive assumptions about the form of the underlying demand and can perform poorly when applied to data which breaks these assumptions. In this talk, we propose a novel unconstraining method that uses Gaussian process (GP) regression. We develop a novel GP model by constructing and implementing a new non-stationary covariance function for the GP which enables it to learn and extrapolate the underlying demand trend. We show that this method can cope with important features of realistic demand data, including nonlinear demand trends, variations in total demand, lengthy periods of constraining, non-exponential inter-arrival times, and discontinuities/changepoints in demand data. In all such circumstances, our results indicate that GPs outperform existing single-class unconstraining methods.