L6

This course will serve as an introduction to the theory of gradient flows with an emphasis on the recent advances in metric spaces. More precisely, we will start with an overview of gradient flows from the Euclidean theory to its generalisation to metric spaces, in particular Wasserstein spaces. This also includes a short introduction to the Optimal Transport theory, with a focus on specific concepts and tools useful subsequently. We will then analyse the time-discretisation scheme à la Jordan--Kinderlehrer-Otto (JKO), also known as minimising movement, and discuss the role of convexity in proving stability, uniqueness, and long-time behaviour for the PDE under study. Finally, we will comment on recent advances, e.g., in the study of PDEs on graphs and/or particle approximation of diffusion equations.

PhD_course_Esposito_1.pdf

This course will serve as an introduction to the theory of gradient flows with an emphasis on the recent advances in metric spaces. More precisely, we will start with an overview of gradient flows from the Euclidean theory to its generalisation to metric spaces, in particular Wasserstein spaces. This also includes a short introduction to the Optimal Transport theory, with a focus on specific concepts and tools useful subsequently. We will then analyse the time-discretisation scheme à la Jordan--Kinderlehrer-Otto (JKO), also known as minimising movement, and discuss the role of convexity in proving stability, uniqueness, and long-time behaviour for the PDE under study. Finally, we will comment on recent advances, e.g., in the study of PDEs on graphs and/or particle approximation of diffusion equations.

PhD_course_Esposito_0.pdf

Sparse inversion and classification problems are ubiquitous in modern data science and imaging. They are often formulated as non-smooth minimisation problems. In sparse inversion, we minimise, e.g., the sum of a data fidelity term and an L1/LASSO regulariser. In classification, we consider, e.g., the sum of a data fidelity term and a non-smooth Ginzburg--Landau energy. Standard (sub)gradient descent methods have shown to be inefficient when approaching such problems. Splitting techniques are much more useful: here, the target function is partitioned into a sum of two subtarget functions -- each of which can be efficiently optimised. Splitting proceeds by performing optimisation steps alternately with respect to each of the two subtarget functions.

In this work, we study splitting from a stochastic continuous-time perspective. Indeed, we define a differential inclusion that follows one of the two subtarget function's negative subdifferential at each point in time. The choice of the subtarget function is controlled by a binary continuous-time Markov process. The resulting dynamical system is a stochastic approximation of the underlying subgradient flow. We investigate this stochastic approximation for an L1-regularised sparse inversion flow and for a discrete Allen-Cahn equation minimising a Ginzburg--Landau energy. In both cases, we study the longtime behaviour of the stochastic dynamical system and its ability to approximate the underlying subgradient flow at any accuracy. We illustrate our theoretical findings in a simple sparse estimation problem and also in low- and high-dimensional classification problems.

In this seminar, we study a tissue growth model with applications to tumour growth. The model is based on that of Perthame, Quirós, and Vázquez proposed in 2014 but incorporated the advective effects caused, for instance, by the presence of nutrients, oxygen, or, possibly, as a result of self-propulsion. The main result of this work is the incompressible limit of this model, which builds a bridge between the density-based model and a geometry free-boundary problem by passing to a singular limit in the pressure law. The limiting objects are then proven to be unique.

The Uniswap v3 ecosystem is built upon liquidity pools, where pairs of tokens are exchanged subject to a fee. We propose a systematic workflow to extract a meaningful but tractable sub-universe out of the current > 6,000 pools. We filter by imposing minimum levels on individual pool features, e.g. liquidity locked and agents’ activity, but also maximising the interconnection between the chosen pools to support broader dynamics. Then, we investigate liquidity consumption behaviour on the most relevant pools for Jan-June 2022. We propose to describe each liquidity taker by a transaction graph, which is a complete graph where nodes are transactions on pools and edges have weights from the time elapsed between pairs of transactions. Each graph is embedded into a vector by our own variant of the NLP rooted graph2vec algorithm. Thus, we are able to investigate the structural equivalence of liquidity takers behaviour and extract seven clusters with interpretable features. Finally, we introduce an ideal crypto law inspired from the ideal gas law of thermodynamics. Our model tests a relationship between variables that govern the mechanisms of each pool, i.e. liquidity provision, consumption, and price variation. If the law is satisfied, we say the pool has high cryptoness and demonstrate that it constitutes a better venue for the activity of market participants. Our metric could be employed by regulators and practitioners for developing pool health monitoring tools and establishing minimum levels of requirements.

(jt work with David Cushing and George Stagg)

Prolog is a rather unusual programming language that was developed by Alain Colmerauer 50 years ago in one of the buildings on the way to the CIRM in Luminy. It is a declarative language that operates on a paradigm of first-order logic -- as distinct from imperative languages like C, GAP and Magma. Prolog operates by loading in a list of axioms as input, and then responds at the command line to queries that ask the language to achieve particular goals, given those axioms. It gained some notoriety through IBM’s implementation of ‘Watson’, which was a system designed to play the game show Jeopardy. Through a very efficiently implemented constraint logic programming module, it is also the worlds fastest sudoku solver. However, it has had barely any serious employment by pure mathematicians. So the aim of this talk is to advertise Prolog through an extended example: my co-authors and I used it to search for new simple Lie algebras over the field GF(2) and were able to classify a certain flavour of absolutely simple Lie algebra in dimensions 15 and 31, discovering a dozen or so new examples. With some further examples in dimension 63, we then extrapolated two previously undocumented infinite families of simple Lie algebras.

Kazhdan-Lusztig polynomials are remarkable polynomials associated to pairs of elements in a Coxeter group W. They describe the base change between the standard and Kazhdan-Lusztig bases for the corresponding Hecke algebra. They were discovered by Kazhdan and Lusztig in 1979 and have found applications throughout representation theory and geometry. In 1987, Deodhar introduced the parabolic Kazhdan-Lusztig polynomials associated to a Coxeter group W and a standard parabolic subgroup P. These describe the base change between the standard and Kazhdan-Lusztig bases for the anti-spherical module for the Hecke algebra. (We recover the original definition of Kazhdan and Lusztig by taking the trivial parabolic subgroup).

(Anti-spherical) Hecke categories first rose to mathematical celebrity as the centrepiece of the proof of the (parabolic) Kazhdan-Lusztig positivity conjecture. The Hecke category categorifies the Hecke algebra and the anti-spherical Hecke category categorifies the anti-spherical module. More precisely, it was shown by Elias-Williamson (and Libedinsky-Williamson) that the (parabolic) Kazhdan-Lusztig polynomials are precisely the graded decomposition numbers for the (anti-spherical) Hecke categories over fields of characteristic zero, hence proving positivity of their coefficients.
The (anti-spherical) Hecke categories can be defined over any field. Their graded decomposition numbers over fields of positive characteristic p, the so-called (parabolic) p-Kazhdan-Lusztig polynomials, have been shown to have deep connections with the modular representation theory of reductive groups and symmetric groups. However, these polynomials are notoriously difficult to compute.
Unlike in the case of the ordinary (parabolic) Kazhdan-Lusztig polynomials, there is not even a recursive algorithm to compute them in general.
In this talk, I will discuss the representation of the anti-spherical Hecke categories for (W,P) a Hermitian symmetric pair, over an arbitrary field. In particular, I will explain why the decomposition numbers are characteristic free in this case.
This is joint work with C. Bowman, A. Hazi and E. Norton.

I will explain how bornological and condensed structures can both be described as algebraic theories. I will also show how this permits the construction of functors between bornological and condensed structures. If time permits I will also briefly describe how to compare condensed derived geometry and bornological derived geometry and sketch how they relate to analytic geometry and Arakelov geometry

The local Langlands conjectures connect representations of p-adic groups to certain representations of Galois groups of local fields called Langlands parameters.  Recently, there has been a shift towards studying representations over more general coefficient rings and towards certain categorical enhancements of the original conjectures.  In this talk, we will focus on representations over coefficient rings with p invertible and how the corresponding category of representations of the p-adic group decomposes.  

In the last few years, major advances have been made in our understanding of the representation theory of reductive algebraic groups over algebraically closed fields of positive characteristic. Four key tools which are central to this progress are highest weight theory, reduction to the principal block, wall-crossing functors, and tilting modules. When considering instead the representation theory of the Lie algebras of these algebraic groups, more subtleties arise. If we look at those modules whose p-character is in so-called standard Levi form we are able to recover the four tools mentioned above, but they have been less well-studied in this setting. In this talk, we will explore the similarities and differences which arise when employing these tools for the Lie algebras rather than the algebraic groups. This research is funded by a research fellowship from the Royal Commission for the Exhibition of 1851.