Past

*Note the different room location (L2) to usual Fridays@4 sessions*

This week is Mental Health Awareness Week. To mark this, Rebecca Reed from Siendo will deliver a session on mental health and wellbeing. The session will cover the following things: 

- The importance of finding a balance with achievement and managing stress and pressure.
- Coping mechanisms work with stresses at work in a positive way (not seeing all stress as bad).
- The difficulties faced in the HE environment, such as the uncertainty felt within jobs and research, combined with the high expectations and workload. 

I'll review 2104.13932, where we analyze the supersymmetric index of N=4 SU(N) Super Yang-Mills using the Bethe Ansatz approach, expressing it as a sum and concentrating on some family of contributions to the sum. We show that in the large N limit each term in this family corresponds to the contribution of a different euclidean black hole to the partition function of the dual gravitational theory. By taking into account non-perturbative contributions (wrapped D3-branes), we further show a one to one match between the contributions of the gravitational saddles and this family of contributions to the index, both at the perturbative and non-perturbative levels. I'll end with some new results regarding the Bethe Ansatz expansion and the information one could extract from it.

The statistical analysis of data which lies in a non-Euclidean space has become increasingly common over the last decade, starting from the point of view of shape analysis, but also being driven by a number of novel application areas. However, while there are a number of interesting avenues this analysis has taken, particularly around positive definite matrix data and data which lies in function spaces, it has increasingly raised more questions than answers. In this talk, I'll introduce some non-Euclidean data from applications in brain imaging and in linguistics, but spend considerable time asking questions, where I hope the interaction of statistics and topological data analysis (understood broadly) could potentially start to bring understanding into the applications themselves.

We can learn a lot about an integral domain by studying the Galois group of its fraction field. These groups are generally quite complicated and hard to understand, but their representations, so-called Galois representations, contain more easily accessible information. These also play the lead in many important theorems and conjectures of modern maths, such as the Modularity theorem and the Langlands programme. In this talk we give a quick introduction to Galois representations, motivated by lots of examples aimed at a general algebraist audience, and talk about some open problems.

Understanding the molecular mechanisms that control the biology of health and disease requires development of models that traverse multiple scales of organisation in order to encapsulate the relationships between genes and linking to observable phenotypes. Measuring, parameterising and simulating the entire system that determines these phenotypes in exhaustive detail is typically impossible due to the underlying biological complexity, our limited knowledge and the paucity of available data. For example, approximately one third of human genes are poorly characterised and most genes perform multiple functions, which manifest according to the surrounding biochemical context. Indeed, new functions continue to emerge even for deeply studied genes. Therefore, simplifying abstractions in concert with empirical analysis of matched genome-scale and descriptive data are valuable strategies to fill knowledge gaps relevant to a focused biomedical question or hypothesis.

Epithelial plasticity is a key driver of cancer progression and is associated with the most life-threatening phenotypes; specifically, metastasis and drug resistance. Computational methods developed in my group enable modelling the molecular control of important cancer phenotypes. We applied a machine learning approach for genome-wide context-specific biochemical interaction network inference (CoSNI) to map gene function for the Epithelial to Mesenchymal Transition cell programme (EMT_MAP), predicting new mechanisms in control of cancer invasion. Analysis of patient data with EMT_MAP and our NetNC algorithm [Cancers 2020;12:2823; https://github.com/overton-group/NetNC] enabled discovery of candidate renal cancer prognostic markers with clear advantages over standard statistical approaches. NetNC recovers the network-defined signal in noisy data, for example distinguishing functional EMT Transcription Factor targets from ‘neutral’ binding sites and defining biologically coherent modules in renal cancer drug response time course data. These and other approaches, including SynLeGG (Nucleic Acids Research 2021;49:W613-8, www.overton-lab.uk/synlegg) and an information-theoretic approach to causality (GABI) offer mechanistic insights and opportunity to predict candidate cancer Achilles’ heels for drug discovery. Computational results were validated in follow-up experiments, towards new clinical tools for precision oncology.

The discrete Fourier transform is fundamental in modern communication systems.  It is used to generate and process (i.e. modulate and demodulate) the signals transmitted in 4G, 5G, and wifi systems, and is always implemented by one of the fast Fourier transforms (FFT) algorithms.  It is possible to generalize the FFT to work correctly on input vectors with periodic missing values.   I will consider whether this has applications, such as more general transmitted signal waveforms, or further applications such as spectral density estimation for time series with missing data.  More speculatively, can we generalize to "recursive" missing values, where the non-missing blocks have gaps?   If so, how do we optimally recognize such a pattern in a given time series?

Last summer, there was a lot of activity regarding an old conjecture of van der Waerden, culminating in its solution by Bhargava, and including joint work by Sam Chow and myself on which I want to report in this talk: We showed that the number of irreducible monic integer polynomials of degree n, with coefficients in absolute value bounded by H, which have Galois group different from S_n and A_n, is of order of magnitude O(H^{n-1.017}), providing that n is at least 3 and is different from 7,8,10. Apart from the alternating group and excluding degrees 7,8,10, this establishes the aforementioned conjecture to the effect that irreducible non-S_n polynomials are significantly less frequent than reducible polynomials.

The Langlands program is a far-reaching collection of conjectures that relate different areas of mathematics including number theory and representation theory. A fundamental problem on the representation theory side of the Langlands program is the construction of all (irreducible, smooth, complex or mod-$\ell$) representations of p-adic groups. I will provide an overview of our understanding of the representations of p-adic groups, with an emphasis on recent progress including joint work with Kaletha and Spice that introduces a twist to the story, and outline some applications.

That the linear systems arising upon the discretization of elliptic PDEs can be solved efficiently is well-known, and iterative solvers that often attain linear complexity (multigrid, Krylov methods, etc) have proven very successful. Interestingly, it has recently been demonstrated that it is often possible to directly compute an approximate inverse to the coefficient matrix in linear (or close to linear) time. The talk will argue that such direct solvers have several compelling qualities, including improved stability and robustness, the ability to solve certain problems that have remained intractable to iterative methods, and dramatic improvements in speed in certain environments.

After a general introduction to the field, particular attention will be paid to a set of recently developed randomized algorithms that construct data sparse representations of large dense matrices that arise in scientific computations. These algorithms are entirely black box, and interact with the linear operator to be compressed only via the matrix-vector multiplication.

Macroscopic Transport in Heterogeneous Porous Materials

Lucy Auton

Solute transport in porous materials is a key physical process in a wide variety of situations, including contaminant transport, filtration, lithium-ion batteries, hydrogeological systems, biofilms, bones and soils. Despite the prevalence of solute transport in porous materials, the effect of microstructure on flow and transport remains poorly understood and improving our understanding of this remains a major challenge.  In this presentation, I consider a two-dimensional microstructure comprising an array of obstacles of smooth but arbitrary shape, the size and spacing of which can vary along the length of the porous medium, allowing for anisotropy.  I use a nontrivial extension to classical homogenisation theory via the method of multiple scales to rigorously upscale the novel problem involving cells of varying area. This results in simple effective continuum equations for macroscale flow and transport where the effect of the microscale geometry on the macroscopic transport and removal is encoded within these simple macroscale equations via effective parameters such as an effective local anisotropic diffusivity and an effective local adsorption rate.  For a simple example geometry I exploit the two degrees of microstructural freedom in this problem, obstacle size and obstacle spacing, to investigate scenarios of uniform porosity but heterogenous microstructure, noting the impact this heterogeneity has on filter efficiency. 

This model constitutes the development of the core framework required to consider other crucial problems such as solute transport within soft porous materials for which there does not currently exist a simple macroscale model where the effective diffusivity and removal depend on the microstructure. Further, via this methodology I will  derive a  bespoke model for fluoride and arsenic removal filters. With this model I will be able to optimise the design of fluoride-removal filters which are being deployed across rural India. The design optimisation will both increase filter lifespan and reduce filter cost, enabling more people to access safe drinking water

Averaged interface conditions: evaporation fronts in porous media

Ellen Luckins

Homogenisation methods are powerful tools for deriving effective PDE models for processes incorporating multiple length-scales. For physical systems in which interface processes are crucial to the overall system, we might ask how the microstructure impacts the effective interface conditions, in addition to the PDEs in the bulk. In this talk we derive an effective model for the motion of an evaporation front through porous media, combining homogenisation and boundary layer analysis to derive averaged interface conditions at the evaporation front. Our analysis results in a new effective parameter in the boundary conditions, which encodes how the shape and speed of the porescale evaporating interfaces impact the overall drying process.

We derive quantitatively the weak and strong Harnack inequality for kinetic Fokker--Planck type equations with a non-local diffusion operator for the full range of the non-locality exponents in (0,1).  This implies Hölder continuity.  We give novel proofs on the boundedness of the bilinear form associated to the non-local operator and on the construction of a geometric covering accounting for the non-locality to obtain the Harnack inequalities.  Our results apply to the inhomogeneous Boltzmann equation in the non-cutoff case.

We will give a fairly self contained introduction to acylindrically hyperbolic groups, using mapping class groups as a motivating example. This will be a mainly expository talk, the aim is to make my topology seminar talk in week 5 more accessible to people who are less familiar with these topics.

The first edition of Thompson’s famous book On Growth and Form appeared in 1917. It has subsequently been regarded as a foundational work in mathematical biology and a revolutionary contribution to the field of morphology. Most existing literature credits Thompson as a lone genius who produced the 793 pages of the 1917 edition and 1116 pages of the 1942 edition. Thompson’s correspondence presents a very different picture of this tome as one arising from extensive and ongoing – perhaps sometimes unwitting? – collaboration.

G2 structure manifolds are a key ingredient in supersymmetric compactifications on seven-manifolds. We will discuss the fact that G2 structure manifolds admit refinements in the form of almost contact (3-) structures.  In fact, there are infinite dimensional spaces of these structures. We will discuss topological and differential geometric aspects of (the space of) these refinements. We will then explore applications in physics, including supersymmetry enhancement. This is based on 2101.12605.

The string 2-group is a fundamental object in string geometry, which is a refinement of spin geometry required to describe the spinning string. While many models for the string 2-group exist, the construction of a representation for it is new. In this talk, I will recall the notion of strict 2-group, and then give two examples: the automorphism 2-group of a von Neumann algebra, and the string 2-group. I will then describe the representation of the string 2-group on the hyperfinite III_1 factor, which is a functor from the string 2-group to the automorphism 2-group of the hyperfinite III_1 factor.

The sinoatrial node (SAN) is the pacemaker region of the heart.
Recently calcium signals, believed to be crucially important in heart
rhythm generation, have been imaged in intact SAN and shown to be
heterogeneous in various regions of the SAN. However, calcium imaging
is noisy, and the calcium signal heterogeneity has not been
mathematically analyzed to distinguish meaningful signals from
randomness or to identify signalling regions in an objective way. In
this work we apply methods of random matrix theory (RMT) developed for
financial data and used for analysis of various biological data sets
including β-cell collectives and EEG data. We find eigenvalues of the
correlation matrix that deviate from RMT predictions, and thus are not
explained by randomness but carry additional meaning. We use
localization properties of the eigenvectors corresponding to high
eigenvalues to locate particular signalling modules. We find that the
top eigenvector captures a common response of the SAN to action
potential. In some cases, the eigenvector corresponding to the second
highest eigenvalue appears to yield a possible pacemaker region as its
calcium signals predate the action potential. Next we study the
relationship between covariance coefficients and distance and find
that there are long range correlations, indicating intercellular
interactions in most cases. Lastly, we perform an analysis of nearest
neighbor eigenvalue distances and find that it coincides with the
universal Wigner surmise. On the other hand, the number variance,
which captures eigenvalue correlations, is a parameter that is
sensitive to experimental conditions. Thus RMT application to SAN
allows to remove noise and the global effects of the action potential
and thereby isolate the correlations in calcium signalling which are
local. This talk is based on joint work with Chloe Norris with a
preprint found here:
https://www.biorxiv.org/content/10.1101/2022.02.25.482007v1.

In this talk, I will introduce the BPS cohomology of the moduli space of Higgs bundles on a smooth projective curve of rank r and degree d using cohomological Donaldson-Thomas theory. The BPS cohomology and the intersection cohomology coincide when r and d are coprime, but they are different in general. We will see that the BPS cohomology does not depend on d. This is a generalization of the Hausel-Thaddeus conjecture to non-coprime case. I will also explain that Toda's χ-independence conjecture (and hence the strong rationality conjecture) for local curves can be proved in the same manner. This talk is based on a joint work with Naoki Koseki and another joint work with Naruki Masuda.

For graphs $G$ and $H$, we say $G \stackrel{r}{\to} H$ if every $r$-colouring of the edges of $G$ contains a monochromatic copy of $H$. Let $H[t]$ denote the $t$-blowup of $H$. The blowup Ramsey number $B(G \stackrel{r}{\to} H;t)$ is the minimum $n$ such that $G[n] \stackrel{r}{\to} H[t]$. Fox, Luo and Wigderson refined an upper bound of Souza, showing that, given $G$, $H$ and $r$ such that $G \stackrel{r}{\to} H$, there exist constants $a=a(G,H,r)$ and $b=b(H,r)$ such that for all $t \in \mathbb{N}$, $B(G \stackrel{r}{\to} H;t) \leq ab^t$. They conjectured that there exist some graphs $H$ for which the constant $a$ depending on $G$ is necessary. We prove this conjecture by showing that the statement is true when $H$ is a $3$-chromatically connected, which includes all cliques on $3$ or more vertices. We are also able to show perhaps surprisingly that for any forest $F$ there is $f(F,t)$ such that  for any $G \stackrel{r}{\to} H$, $B(G \stackrel{r}{\to} H;t)\leq f(F,t)$ i.e. the function does not depend on the ground graph $G$. This is joint work with Robert Hancock.

Co-occurrence networks formed by bipartite projection are widely studied in many contexts, including politics (bill co-sponsorship), bibliometrics (paper co-authorship), ecology (species co-habitation), and genetics (protein co-expression). It is often useful to focus on the backbone, a binary representation that includes only the most important edges, however many different backbone extraction models exist. In this talk, I will demonstrate the "backbone" package for R, which implements many such models. I will also use it to compare two promising null models: the fixed degree sequence model (FDSM) that imposes hard constraints, and the stochastic degree sequence model (SDSM) that imposes soft constraints, on the bipartite degree sequences. While FDSM is more statistically powerful, SDSM is more efficient and offers a close approximation.

One core aim of (supervised) machine learning is to approximate an unknown function given a dataset containing examples of input-output pairs. Real-world examples of such functions include the mapping from an image to its label or the mapping from a molecule to its energy. For a variety of such functions, while the precise mapping is unknown, we often have knowledge of its properties. For example, the label of an image may be invariant to rotations of the input image. Generally, such properties formally correspond to the function being equivariant to certain actions on its input and output spaces. This has led to much research on building equivariant function classes (aka neural networks). In this talk, we survey this growing field of equivariance in deep learning for a mathematical audience, motivating the need for equivariance, covering concrete examples of equivariant neural networks, and offering a learning theoretic perspective on the benefits of equivariance. 

In the search for a complete description of quantum mechanical and
gravitational phenomena, we are inevitably led to consider observables on
boundaries at infinity. This is the common mantra that there are no local
observables in quantum gravity and gives rise to the tantalising possibility
of a purely boundary--or holographic--description of physics in the
interior. The AdS/CFT correspondence provides an important working example
of these ideas, where the boundary description of quantum gravity in anti-de
Sitter (AdS) space is an ordinary quantum mechanical system-- in particular,
a Lorentzian Conformal Field Theory (CFT)--where the rules of the game are
well understood. It would be desirable to have a similar level of
understanding for the universe we actually live in. In this talk I will
explain some recent efforts that aim to understand the rules of the game for
observables on the future boundary of de Sitter (dS) space. Unlike in AdS,
the boundaries of dS space are purely spatial with no standard notion of
locality and time. This obscures how the boundary observables capture a
consistent picture of unitary time evolution in the interior of dS space. I

will explain how, despite this difference, the structural similarities
between dS and AdS spaces allow to forge relations between boundary
correlators in these two space-times. These can be used to import
techniques, results and understanding from AdS to dS.

The aim of this course is to give an introduction to the regularity theory of non-smooth spaces with lower bounds on the Ricci Curvature. This is a quickly developing field with motivations coming from classical questions in Riemannian and differential geometry and with connections to Probability, Geometric Measure Theory and Partial Differential Equations.

In the lectures we will focus on the non collapsed case, where much sharper results are available, mainly adopting the synthetic approach of the RCD theory, rather than following the original proofs.

The techniques used in this setting have been applied successfully in the study of Minimal surfaces, Elliptic PDEs, Mean curvature flow and Ricci flow and the course might be of interest also for people working in these subjects.

In this talk, I would like to discuss Deligne’s version of Geometric Class Field theory, with special emphasis on the correspondence between rigidified 1-dimensional l-adic local systems on a curve and 1-dimensional l-adic local systems on Pic with certain compatibilities. We should like to give a sense of how this relates to the OG class field theory, and how Deligne demonstrates this correspondence via the geometry of the Abel-Jacobi Map. If time permits, we would also like to discuss the correspondence between continuous 1-dimensional l-adic representations of the etale fundamental group of a curve and local systems.

We will review some open questions about automorphisms of free groups, give some partial answers, and explain the deformation spaces of trees that they act on, as well as the geometry of these spaces arising from the Lipschitz metric. This will be a gentle introduction to the topic, focused on introducing the concepts.

 We develop a probabilistic framework for analysing model-based reinforcement learning in the episodic setting. We then apply it to study finite-time horizon stochastic control problems with linear dynamics but unknown coefficients and convex, but possibly irregular, objective function. Using probabilistic representations, we study regularity of the associated cost functions and establish precise estimates for the performance gap between applying optimal feedback control derived from estimated and true model parameters. We identify conditions under which this performance gap is quadratic, improving the linear performance gap in recent work [X. Guo, A. Hu, and Y. Zhang, arXiv preprint, arXiv:2104.09311, (2021)], which matches the results obtained for stochastic linear-quadratic problems. Next, we propose a phase-based learning algorithm for which we show how to optimise exploration-exploitation trade-off and achieve sublinear regrets in high probability and expectation. When assumptions needed for the quadratic performance gap hold, the algorithm achieves an order (N‾‾√lnN) high probability regret, in the general case, and an order ((lnN)2) expected regret, in self-exploration case, over N episodes, matching the best possible results from the literature. The analysis requires novel concentration inequalities for correlated continuous-time observations, which we derive.

-----------------------------------------------------------------------
Dr Lukasz Szpruch

The integral of mean curvature squared is a conformal invariant of surfaces reintroduced by Willmore in 1965 whose study exercised a tremendous influence on geometric analysis and most notably on minimal surfaces in the last years.

On the other hand, the Loewner energy is a conformal invariant of planar curves introduced by Yilin Wang in 2015 which is notably linked to SLE processes and the Weil-Petersson class of (universal) Teichmüller theory.

In this presentation, after a brief historical introduction, we will discuss some recent developments linking the Willmore energy to the Loewner energy and mention several open problems.

Joint work with Yilin Wang (MIT/MSRI)

Topological defects in quantum field theory can be understood as a generalised notion of symmetry, where the operation is not required to be invertible. Duality transformations are an important example of this. By considering defects of various dimensions, one is naturally led to more complicated algebraic structures than just groups. So-called 2-groups are a first instance, which arise from invertible defects of codimension 1 and 2. Without invertibility one arrives at so-called "fusion categories”. I would like to explain how one can "gauge" such non-invertible symmetries in the case of topological field theories, and I will focus on results in two and three dimensions. This talk is based on joint work with Nils Carqueville, Vincentas Mulevicius, Gregor Schaumann, and Daniel Scherl.

We define a perturbatively calculable quantity—the on-shell correlator—which furnishes a unified description of particle dynamics in curved spacetime. Specializing to the case of flat and anti-de Sitter space, on-shell correlators coincide precisely with on-shell scattering amplitudes and boundary correlators, respectively. Remarkably, we find that symmetric manifolds admit a generalization of on-shell kinematics in which the corresponding momenta are literally the isometry generators of the spacetime acting on the external kinematic data. These isometric momenta are intrinsically non-commutative but exhibit on-shell conditions that are identical to those of flat space, thus providing a common language for computing and representing on-shell correlators which is agnostic about the underlying geometry. 

As applications of these tools, we compute n-point scalar correlators in AdS in terms of isometric momenta. In many cases, the results are direct lifts of flat-space expressions. We provide field-theoretic proofs of color-kinematics duality and BCJ relations in AdS at n-points in biadjoint scalar theory and the nonlinear sigma model. We discuss possible extensions to generic curved spacetimes without symmetry.

I will explain in what sense the theory of finite tensor categories is a categorification of the theory of finite dimensional algebras. In particular, I will introduce finite module categories, review a key result of Ostrik, and present Morita theory for finite categories. I will give many examples to illustrate these ideas. Then, I will explain the elementary properties of finite braided tensor categories. If time permits, I will also mention my own work, which consists in categorifying these ideas once more!

Dynamical systems models are a powerful tool for analyzing interactions in ecosystems and their intrinsic properties such as stability and resilience. The human intestinal microbiome is a complex ecosystem of hundreds of microbial species, critical to our health, and when in a disrupted state termed dysbiosis, is involved in a variety of diseases.  Although dysbiosis remains incompletely understood, it is not caused by single pathogens, but instead involves broader disruptions to the microbial ecosystem.  Dynamical systems models would thus seem a natural approach for analyzing dysbiosis, but have been hampered by the scale of the human gut microbiome, which constitutes hundreds of thousands of potential ecological interactions, and is profiled using sparse and noisy measurements. Here we introduce a combined experimental and statistical machine learning approach that overcomes these challenges to provide the first comprehensive and predictive model of microbial dynamics at ecosystem-scale. We show that dysbiosis is characterized by competitive cycles of interactions among microbial species, in contrast to the healthy microbiome, which is stabilized by chains of positive interactions initiated by resistant starch-degrading bacteria. To achieve these results, we created cohorts of “humanized” gnotobiotic mice via fecal transplantation from healthy and dysbiotic human donors, and subjected mice to dietary and antibiotic perturbations, in the densest temporal interventional study to date. We demonstrate that our probabilistic machine learning method achieves scalability while maintaining interpretability on these data, by inferring a small number of modules of bacterial taxa that share common interactions and responses to perturbations. Our findings provide new insights into the mechanisms of microbial dysbiosis, have potential implications for therapies to restore the microbiome to treat disease, and moreover offer a powerful framework for analyzing other complex ecosystems.

Lahars and huaicos are potent natural hazards that threaten lives and livelihoods. They comprise debris-laden fluid that flows rapidly down slopes, bulking up considerably as they progress. Owing to their rapid onset and the significant threat that they pose to communities and infrastructures, it is important to be able to predict their motion in order to assess quantitatively some of the impacts that they may cause. In this seminar I will present mathematical models of these flows and apply them to various natural settings, drawing on examples from Peru and the Philippines.  Along the way I will show some informative, idealised solutions, the susceptibility of these flows to roll wave instabilities, ways to prevent ill-posedness and how to include measured topography in the computation.

We would like to share two challenges that, if solved, could improve our domestic lives.  

 Firstly, having appliances that are as unobtrusive as possible is a strong desire, unwanted noise can cause a negative impact on relaxation.  A key target for refrigerators is low sound level, a key noise source is the capillary tube.  The capillary tube effects the phase change that is required for the refrigerant to be in the gaseous state in the evaporator for cooling.  Noise is generated during this process due to two phases being present within the flow through the tube.  The challenge is to create a numerical model and analysis of refrigerant flow properties in order to estimate the acoustic behaviour.

 Secondly, we would like to maximise the information that can be gathered from our new range of connected devices.  By analysing the data generated during usage we would like to be able to predict faults and understand user behaviour in more detail.  The challenge regarding fault prediction is the scarcity of the failure data and the impact of false positives.  Due to the number of units in the field, a relatively small fraction of false positives can remove the ROI from such an initiative.  We would like to understand if advanced machine learning methods can be used to reduce this risk.

As a model for the primes, in this talk I will address such statistical questions for the sequence of squarefree numbers, i.e., numbers not divisible by the square of any prime, among other related ``sifted'' sequences called B-free numbers. I hope to further motivate and explain our main result that shows, unconditionally, that short interval counts of squarefree numbers do satisfy Gaussian statistics, answering several questions of R.R. Hall.

The Skolem Problem asks to decide whether a linearly recurrent sequence (LRS) over the rationals has a zero term.  It is sometimes considered as the halting problem for linear loops.   In this talk we will give an overview of two current approaches to establishing decidability of this problem.  First, we observe that the Skolem Problem for LRS with simple characteristic roots is decidable subject to the $p$-adic Schanuel conjecture and the exponential-local-global principle.  Next, we define a set $S$ of positive integers such that (i) $S$ has positive lower density and (ii) The Skolem Problem is decidable relative to $S$, i.e., one can effectively determine the set of all zeros of a given LRS that lie in $S$.

The talk is based on joint work with Y. Bilu, F. Luca, J. Ouaknine, D. Pursar, and J. Nieuwveld.  

In space dimension 2 we present a finite element complex for the deformation operator acting on vectorfields and the linearized curvature operator acting on symmetric 2 by 2 matrices. We also present the tools that were used in the construction, namely the BGG diagram chase and the framework of finite element systems. For this general framework we can prove a de Rham theorem on cohomology groups in the flat case and a Bianchi identity in the case with curvature.

Latent Dirichlet Allocation (LDA) is capable of analyzing thousands of documents in a short time and highlighting important elements, recurrences and anomalies. It is generally used in linguistics to study natural language: its word analysis reveals the theme(s) of a document, each theme being identified by a specific vocabulary or, more precisely, by a particular statistical distribution of word frequency.
In the climatologists' use of LDA, the document is a daily weather map and the word is a pixel of the map. The theme with its corpus of words can become a cyclone or an anticyclone and, more generally, a 'pattern'  that the scientists term motif. Artificial intelligence – a sort of incredibly fast robot meteorologist – looks for correlations both between different places on the same map, and between successive maps over time. In a sense, it 'notices' that a particular location is often correlated with another location, recurrently throughout the database, and this set of correlated locations constitutes a specific pattern.
The algorithm performs statistical analyses at two distinct levels: at the word or pixel level of the map, LDA defines a motif, by assigning a certain weight to each pixel, and thus defines the shape and position of the motif;  LDA breaks down a daily weather map into all these motifs, each of which is assigned a certain weight.
In concrete terms, the basic data are the daily weather maps between 1948 and nowadays over the North Atlantic basin and Europe. LDA identifies a dozen or so spatially defined motifs, many of which are familiar meteorological patterns such as the Azores High, the Genoa Low or even the Scandinavian Blocking. A small combination of those motifs can then be used to describe all the maps. These motifs and the statistical analyses associated with them allow researchers to study weather phenomena such as extreme events, as well as longer-term climate trends, and possibly to understand their mechanisms in order to better predict them in the future.

The preprint of the study is available as:
 Lucas Fery, Berengere Dubrulle, Berengere Podvin, Flavio Pons, Davide Faranda. Learning a weather dictionary of atmospheric patterns using Latent Dirichlet Allocation. 2021. ⟨hal-03258523⟩ https://hal-enpc.archives-ouvertes.fr/X-DEP-MECA/hal-03258523v1
 

We study the definability of valuation rings in ordered fields (in the language of ordered rings). We show that any henselian valuation ring that is definable in the language of ordered rings is already definable in the language of rings. However, this does not hold when we drop the assumption of henselianity.

This is joint work with Philip Dittmann, Sebastian Krapp and Salma Kuhlmann.

Groupoid C*-algebras and twisted groupoid C*-algebras are introduced by Renault in the late ’70. Twisted groupoid C*-algebras have since proved extremely important in the study of structural properties for large classes of C*-algebras. On the other hand, Steinberg algebras are introduced independently by Steinberg and Clark, Farthing, Sims and Tomforde around 2010 which are a purely algebraic analogue of groupoid C*-algebras. Steinberg algebras provide useful insight into the analytic theory of groupoid C*-algebras and give rise to interesting examples of *-algebras. In this talk, I will first recall some relevant background on topological groupoids and twisted groupoid C*-algebras, then I will introduce twisted Steinberg algebras which generalise the Steinberg algebras and provide a purely algebraic analogue of twisted groupoid C*-algebras. If I have enough time, I will further introduce pair of algebras which consist of a Steinberg algebra and an algebra of locally constant functions on the unit space, it is an algebraic analogue of Cartan pairs

Given a variety defined over a field of characteristic zero and an algebraically integrable foliation of corank less than or equal to two, we show the existence of a categorical quotient, defined on the non-empty open subset of algebraically smooth points, through which every invariant morphism factors uniquely. Some applications to quotients by connected groups will be discussed.
 

The characteristic polynomial of a random Hermitian matrix induces naturally a field on the real line. In the case of the Gaussian Unitary ensemble (GUE), this fields is expected to have a very special correlation structure: the logarithm of this field is log-correlated and its maximum is at the heart of a conjecture from Fyodorov and Simm predicting its asymptotic behavior.   As a first step in this direction, we obtained in collaboration with R. Butez and O. Zeitouni, a central limit theorem for the logarithm of the characteristic polynomial of the Gaussian beta Ensembles and for a certain class of random Jacobi matrices. In this talk, I will explain how the tridiagonal representation of the GUE and orthogonal polynomials techniques allow us to analyse the fluctuations of the characteristic polynomial.

We investigate the maximum distance of a rank-two tensor to rank-one tensors. An equivalent problem is given by the minimal ratio of spectral and Frobenius norm of a tensor. For matrices the distance of a rank k matrix to a rank r matrices is determined by its singular values, but since there is a lack of a fitting analog of the singular value decomposition for tensors, this question is more difficult in the regime of tensors.
 

This talk is about the global structure of planar graphs and other more general graph classes. The starting point is the Lipton-Tarjan separator theorem, followed by Baker's decomposition of a planar graph into layers with bounded treewidth. I will then move onto layered treewidth, which is a more global version of Baker's decomposition. Layered treewidth is a precursor to the recent development of row treewidth, which has been the key to solving several open problems. Finally, I will describe generalisations for arbitrary minor-closed classes.

In this talk I will present network-theoretic tools [1-2] to filter information in large-scale datasets and I will show that these are powerful tools to study complex datasets. In particular I will introduce correlation-based information filtering networks and the planar filtered graphs (PMFG) and I will show that applications to financial data-sets can meaningfully identify industrial activities and structural market changes [3-4].

It has been shown that by making use of the 3-clique structure of the PMFG a clustering can be extracted allowing dimensionality reduction that keeps both local information and global hierarchy in a deterministic manner without the use of any prior information [5-6]. However, the algorithm so far proposed to construct the PMFG is numerically costly with O(N3) computational complexity and cannot be applied to large-scale data. There is therefore scope to search for novel algorithms that can provide, in a numerically efficient way, such a reduction to planar filtered graphs. I will introduce a new algorithm, the TMFG (Triangulated Maximally Filtered Graph), that efficiently extracts a planar subgraph which optimizes an objective function. The method is scalable to very large datasets and it can take advantage of parallel and GPUs computing [7]. Filtered graphs are valuable tools for risk management and portfolio optimization too [8-9] and they allow to construct probabilistic sparse modeling for financial systems that can be used for forecasting, stress testing and risk allocation [10].

Filtered graphs can be used not only to extract relevant and significant information but more importantly to extract knowledge from an overwhelming quantity of unstructured and structured data. I will provide a practitioner example by a successful Silicon Valley start-up, Yewno. The key idea underlying Yewno’s products is the concept of the Knowledge Graph, a framework based on filtered graph research, whose goal is to extract signals from evolving corpus of data. The common principle is that a methodology leveraging on developments in Computational linguistics and graph theory is used to build a graph representation of knowledge [11], which can be automatically analysed to discover hidden relations between components in many different complex systems. This Knowledge Graph based framework and inference engine has a wide range of applications, including finance, economics, biotech, law, education, marketing and general research.

[1] T. Aste, T. Di Matteo, S. T. Hyde, Physica A 346 (2005) 20.

[2] T. Aste, Ruggero Gramatica, T. Di Matteo, Physical Review E 86 (2012) 036109.

[3] M. Tumminello, T. Aste, T. Di Matteo, R. N. Mantegna, PNAS 102, n. 30 (2005) 10421.

[4] N. Musmeci, Tomaso Aste, T. Di Matteo, Journal of Network Theory in Finance 1(1) (2015) 1-22.

[5] W.-M. Song, T. Di Matteo, and T. Aste, PLoS ONE 7 (2012) e31929.

[6] N. Musmeci, T. Aste, T. Di Matteo, PLoS ONE 10(3): e0116201 (2015).

[7] Guido Previde Massara, T. Di Matteo, T. Aste, Journal of Complex networks 5 (2), 161 (2016).

[8] F. Pozzi, T. Di Matteo and T. Aste, Scientific Reports 3 (2013) 1665.

[9] N. Musmeci, T. Aste and T. Di Matteo, Scientific Reports 6 (2016) 36320.

[10] Wolfram Barfuss, Guido Previde Massara, T. Di Matteo, T. Aste, Phys.Rev. E 94 (2016) 062306.

[11] Ruggero Gramatica, T. Di Matteo, Stefano Giorgetti, Massimo Barbiani, Dorian Bevec and Tomaso Aste, PLoS One (2014) PLoS ONE 9(1): e84912.

iii) identify a special class of correlated compressors based on the idea of random permutations, for which we coin the term PermK. The use of this technique results in the strict improvement on the previous MARINA rate. In the low Hessian variance regime, the improvement can be as large as √n, when d > n, and 1 + √d/n, when n<=d, where n is the number of workers and d is the number of parameters describing the model we are learning.

Ardakov and Wadsley developed a theory of D-modules on rigid analytic spaces and established a Beilinson-Bernstein style localisation theorem for coadmissible modules over the locally analytic distribution algebra. Using this theory, they obtained admissible locally analytic representations of SL_2 by taking global sections of Drinfeld line bundles. In this talk, we will extend their techniques to SL_3 by studying the Drinfeld upper half-space \Omega^{(3)} of dimension 2.

In 2020, cirrhosis and other liver diseases were among the top five causes of death for
individuals aged 35-65 in Scotland, England and Wales. At present, the only curative
treatment for end-stage liver disease is through transplant which is unsustainable.
Stem cell therapies could provide an alternative. By encapsulating the stem cells we
can modulate the shear stress imposed on each cell to promote integrin expression
and improve the probability of engraftment. We model an individual, hydrogel-coated
stem cell moving along a fluid-filled channel due to a Stokes flow. The stem cell is
treated as a Newtonian fluid and the coating is treated as a poroelastic material with
finite thickness. In the limit of a stiff coating, a semi-analytical approach is developed
which exploits a decoupling of the fluids and solid problems. This enables the tractions
and pore pressures within the coating to be obtained, which then feed directly into a
purely solid mechanics problem for the coating deformation. We conduct a parametric
study to elucidate how the properties of the coating can be tuned to alter the stress
experienced by the cell.

Holography in asymptotically flat spaces is one of the most coveted goals of modern mathematical physics. In this talk, I will motivate a novel holographic description of self-dual SO(8) Yang-Mills + self-dual conformal gravity on a Euclidean signature, asymptotically flat background called Burns space. The holographic dual lives on a stack of D1-branes wrapping a CP^1 cycle in the twistor space of R^4 and is given by a gauged beta-gamma system with SO(8) flavor and a pair of defects at the north and south poles. It provides the first example of a stringy realization of (asymptotically) flat holography and is a Euclidean signature variant of celestial holography. This is based on ongoing work with Kevin Costello and Natalie Paquette.

The aim of this course is to give an introduction to the regularity theory of non-smooth spaces with lower bounds on the Ricci Curvature. This is a quickly developing field with motivations coming from classical questions in Riemannian and differential geometry and with connections to Probability, Geometric Measure Theory and Partial Differential Equations.

In the lectures we will focus on the non collapsed case, where much sharper results are available, mainly adopting the synthetic approach of the RCD theory, rather than following the original proofs.

The techniques used in this setting have been applied successfully in the study of Minimal surfaces, Elliptic PDEs, Mean curvature flow and Ricci flow and the course might be of interest also for people working in these subjects.