Past

11:30 Refreshments (tea, coffee and homemade biscuits)

12:00 Talks (main room)

13:15 Buffet Style Lunch (incl. tea, coffee and homemade cakes)

15:00 End

After a general introduction to the study of random walks on groups, we discuss the relationship between limit theorems for random walks on Lie groups and Diophantine properties of the underlying distribution. Indeed, we will discuss the classical abelian case and more recent results by Bourgain-Gamburd for compact simple Lie groups such as SO(3). If time permits, we discuss some new results for non-compact simple Lie groups such as SL_2(R). We hope to touch on the relevant methods from harmonic analysis, number theory and additive combinatorics. The talk is aimed at a general audience. 

We will discuss shock reflection phenomena, mathematical formulation of shock reflection problem, structures of  shock reflection configurations, and von Neumann conjectures on transition between regular and Mach reflections. Then we will describe the results on existence and properties of regular reflection solutions for potential flow equation. The approach is to reduce the shock reflection problem to a free boundary problem for a nonlinear  elliptic equation in self-similar coordinates, where the reflected shock is the free boundary, and ellipticity degenerates near a part of a fixed boundary. We will discuss the techniques and methods used in the study of such free boundary problems.

 

Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas. In 2006, Kahn and Kalai conjectured that for any nontrivial increasing property on a finite set, its threshold is never far from its "expectation-threshold," which is a natural (and often easy to calculate) lower bound on the threshold. In this talk, I will present recent progress on this topic. Based on joint work with Huy Tuan Pham.

 I will discuss ongoing work with Toke Carlsen and Aidan Sims on ideal structure of C*-algebras of commuting local homeomorphisms. This is one aspect of a general attempt to bridge C*-algebras with multidimensional (symbolic) dynamics.

Social, biological and physical systems are widely studied through the modeling of dynamical processes over networks, and one commonly investigates the interplay between structure and dynamics. I will discuss how cyclic patterns in networks can influence models for collective and diffusive processes, including generalized models in which dynamics are defined over simplicial complexes and multiplex networks. Our approach relies on homology theory, which is the subfield of mathematics that formally studies cycles (and more generally, k-dimensional holes). We will make use of techniques including persistent homology and Hodge theory to examine the role of cycles in helping organize dynamics onto low-dimensional manifolds. This pursuit represents an emerging interface between the fields of network-coupled dynamical systems and topological data analysis.

Let G(R) be the real points of a complex reductive algebraic group G. There are many difficult questions about admissible representations of real reductive groups which have (relatively) easy answers in the case of complex groups. Thus, it is natural to look for a relationship between representations of G and representations of G(R). In this talk, I will introduce a functor from admissible representations of G to admissible representations of G(R). This functor interacts nicely with many natural invariants, including infinitesimal character, associated variety, and restriction to a maximal compact subgroup, and it takes unipotent representations of G to unipotent representations of G(R).

We will discuss shock reflection phenomena, mathematical formulation of shock reflection problem, structures of  shock reflection configurations, and von Neumann conjectures on transition between regular and Mach reflections. Then we will describe the results on existence and properties of regular reflection solutions for potential flow equation. The approach is to reduce the shock reflection problem to a free boundary problem for a nonlinear  elliptic equation in self-similar coordinates, where the reflected shock is the free boundary, and ellipticity degenerates near a part of a fixed boundary. We will discuss the techniques and methods used in the study of such free boundary problems.

 

Hydrodynamics allow for efficient computation of many-body dynamics and have been successfully used in the study of black hole horizons, collective behaviour of QCD matter in heavy ion collisions, and non-equilibrium behaviour in strongly-interacting condensed matter systems.
In this talk, I will present the application of hydrodynamics to quantum field theory with an infinite number of local conservation laws. Such an integrable system can be described within the recently developed framework of generalised hydrodynamics. I will present the key assumptions of generalised hydrodynamics as well as summarise some recent developments in this field. In particular, I will concentrate on the study of the SU(3)_2-Homogeneous sine-Gordon model. Thanks to the hydrodynamic approach, we were able to identify the key dynamical signatures of unstable excitations in this integrable quantum field theory and simulate the real time RG-flow of the theory between interacting and free conformal regimes.
The talk is based on joint work with Olalla Castro-Alvaredo, Cecilia De Fazio and Benjamin Doyon.

We consider an oriented acyclic version of the Erdős-Rényi random graph: the set of vertices is {1,...,n}, and for each pair i < j, an edge from i to j is independently added to the graph with probability p. The length of the longest path in such a graph grows linearly with the number of vertices in the graph, and its growth rate is a deterministic function C of the probability p of presence of an edge.
Foss and Konstantopoulos introduced a coupling between these graphs and a particle system called the "Infinite-bin model". By using this coupling, we prove some properties of C, that it is analytic on (0,1], its development in series at point 1 and its asymptotic behaviour as p goes to 0.

I will introduce a new parabolic system for the flow of nematic liquid crystals, enjoying a free boundary condition. After recent works related to the construction of blow-up solutions for several critical parabolic problems (such as the Fujita equation, the heat flow of harmonic maps, liquid crystals without free boundary, etc...), I will  construct a physically relevant weak solution blowing-up in finite time. We make use of  the so-called inner/outer parabolic gluing. Along the way, I will present a set of optimal estimates for the Stokes operator with Navier slip boundary conditions. I will state several open problems related to the partial regularity of the system under consideration. This is joint work with F.-H. Lin (NYU), Y. Zhou (JHU) and J. Wei (UBC). 

We show that ribbon concordance forms a partial ordering on the set of knots, answering a question of Gordon. The proof makes use of representation varieties of the knot groups to S O(N) and relations between them induced by a ribbon concordance.

(Joint with Y. Lekili) If someone gives you a variety with a singular point, you can try and get some understanding of what the singularity looks like by taking its “link”, that is you take the boundary of a neighbourhood of the singular point. For example, the link of the complex plane curve with a cusp $y^2 = x^3$ is a trefoil knot in the 3-sphere. I want to talk about the links of a class of 3-fold singularities which come up in Mori theory: the compound Du Val (cDV) singularities. These links are 5-dimensional manifolds. It turns out that many cDV singularities have the same 5-manifold as their link, and to tell them apart you need to keep track of some extra structure (a contact structure). We use symplectic cohomology to distinguish the contact structures on many of these links.

Cryo-Electron Microscopy (cryo-EM) is an imaging technology that is revolutionizing structural biology. Cryo-electron microscopes produce many very noisy two-dimensional projection images of individual frozen molecules; unlike related methods, such as computed tomography (CT), the viewing direction of each particle image is unknown. The unknown directions and extreme noise make the determination of the structure of molecules challenging. While other methods for structure determination, such as x-ray crystallography and NMR, measure ensembles of molecules, cryo-electron microscopes produce images of individual particles. Therefore, cryo-EM could potentially be used to study mixtures of conformations of molecules. We will discuss a range of recent methods for analyzing the geometry of molecular conformations using cryo-EM data.

Hydrodynamic excitations corresponding to sound and shear modes in fluids are characterized by gapless dispersion relations. In the hydrodynamic gradient expansion, their frequencies are represented by power series in spatial momenta. In this talk we will discuss the convergence properties of the hydrodynamic series by studying the associated spectral curve in the space of complexified frequency and complexified spatial momentum. For the N=4 supersymmetric Yang-Mills plasma at infinite 't Hooft coupling, we will use the holographic methods to demonstrate that the derivative expansions have finite non-zero radii of convergence. Obstruction to the convergence of hydrodynamic series arises from level-crossings in the quasinormal spectrum at complex momenta. We will discuss how finiteness of 't Hooft coupling affects the radius of convergence. We will show that the purely perturbative calculation in terms of inverse 't Hooft coupling gives the increasing radius of convergence when the coupling is decreasing. Applying the non-perturbative resummation techniques will make radius of convergence piecewise continuous function that decreases after the initial increase. Finally, we will provide arguments in favour of the non-perturbative approach and show that the presence of nonperturbative modes in the quasinormal spectrum can be indirectly inferred from the analysis of perturbative critical points.

In this talk, we will present a new class of invariants of multi-parameter persistence modules : \emph{projected barcodes}. Relying on Grothendieck's six operations for sheaves, projected barcodes are defined as derived pushforwards of persistence modules onto $\R$ (which can be seen as sheaves on a vector space in a precise sense). We will prove that the well-known fibered barcode is a particular instance of projected barcodes. Moreover, our construction is able to distinguish persistence modules that have the same fibered barcodes but are not isomorphic. We will present a systematic study of the stability of projected barcodes. Given F a subset of the 1-Lipschitz functions, this leads us to define a new class of well-behaved distances between persistence modules, the  F-Integral Sheaf Metrics (F-ISM), as the supremum over p in F of the bottleneck distance of the projected barcodes by p of two persistence modules. 

In the case where M is the collection in all degrees of the sublevel-sets persistence modules of a function f : X -> R^n, we prove that the projected barcode of M by a linear map p : R^n \to R is nothing but the collection of sublevel-sets barcodes of the post-composition of f by p. In particular, it can be computed using already existing softwares, without having to compute entirely M. We also provide an explicit formula for the gradient with respect to p of the bottleneck distance between projected barcodes, allowing to use a gradient ascent scheme of approximation for the linear ISM. This is joint work with François Petit.

In this talk I will introduce affine Hecke algebras and discuss some of their representation theory, in particular their Fourier transform. We will consider discrete series representations and how their formal degrees can help us understand them. There is no quantity like the formal degree available to help us similarly study limits of discrete series representations. I will sketch how this difficulty might be overcome by using cyclic cohomology and its pairing with K-theory to introduce generalized formal degrees.

In this talk I will review some of the key ideas behind
the study of entanglement measures in 1+1D quantum field theories employing
the so-called branch point twist field approach. This method is based on the
existence of a one-to-one correspondence between different entanglement
measures and different multi-point functions of a particular type of
symmetry field. It is then possible to employ standard methods for the
evaluation of correlation functions to understand properties of entanglement
in bipartite systems. Time permitting, I will then present a recent
application of this approach to the study of a new entanglement measure: the
symmetry resolved entanglement entropy.

In this talk I will review some of the key ideas behind the study of entanglement measures in 1+1D quantum field theories employing the so-called branch point twist field approach. This method is based on the existence of a one-to-one correspondence between different entanglement measures and different multi-point functions of a particular type of symmetry field. It is then possible to employ standard methods for the evaluation of correlation functions to understand properties of entanglement in bipartite systems. Time permitting, I will then present a recent application of this approach to the study of a new entanglement measure: the symmetry resolved entanglement entropy.

Representations of finite reductive groups have a rich, well-understood structure, first explored by Deligne--Lusztig. In joint work with Anne-Marie Aubert and Dan Ciubotaru, we show a way to lift some of this structure to representations of p-adic groups. In particular, we consider the relation between Lusztig's nonabelian Fourier transform and a certain involution we define on the level of p-adic groups. This talk will be an introduction to these ideas with a focus on examples.

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.
 

Junior Strings is a seminar series where DPhil students present topics of common interest that do not necessarily overlap with their own research area. This is primarily aimed at PhD students and post-docs but everyone is welcome.

We consider the Bayesian inverse problem of inferring the initial condition of a linear dynamical system from noisy output measurements taken after the initial time. In practical applications, the large dimension of the dynamical system state poses a computational obstacle to computing the exact posterior distribution. Balanced truncation is a system-theoretic method for model reduction which obtains an efficient reduced-dimension dynamical system by projecting the system operators onto state directions which simultaneously maximize energies defined by reachability and observability Gramians. We show that in our inference setting, the prior covariance and Fisher information matrices can be naturally interpreted as reachability and observability Gramians, respectively. We use these connections to propose a balancing approach to model reduction for the inference setting. The resulting reduced model then inherits stability properties and error bounds from system theory, and yields an optimal posterior covariance approximation. 

It is well known that stochasticity can play a fundamental role in various biochemical processes, such as cell regulatory networks and enzyme cascades. Isothermal, well-mixed systems can be adequately modeled by Markov processes and, for such systems, methods such as Gillespie’s algorithm are typically employed. While such schemes are easy to implement and are exact, the computational cost of simulating such systems can become prohibitive as the frequency of the reaction events increases. This has motivated numerous coarse-grained schemes, where the “fast” reactions are approximated either using Langevin dynamics or deterministically. While such approaches provide a good approximation for systems where all reactants are present in large concentrations, the approximation breaks down when the fast chemical species exist in small concentrations, giving rise to significant errors in the simulation. This is particularly problematic when using such methods to compute statistics of extinction times for chemical species, as well as computing observables of cell cycle models. In this talk, we present a hybrid scheme for simulating well-mixed stochastic kinetics, using Gillespie–type dynamics to simulate the network in regions of low reactant concentration, and chemical Langevin dynamics when the concentrations of all species are large. These two regimes are coupled via an intermediate region in which a “blended” jump-diffusion model is introduced. Examples of gene regulatory networks involving reactions occurring at multiple scales, as well as a cell-cycle model are simulated, using the exact and hybrid scheme, and compared, both in terms of weak error, as well as computational cost. If there is time, we will also discuss the extension of these methods for simulating spatial reaction kinetics models, blending together partial differential equation with compartment based approaches, as well as compartment based approaches with individual particle models.

This is joint work with Andrew Duncan (Imperial), Radek Erban (Oxford), Kit Yates (Bath), Adam George (Bath), Cameron Smith (Bath), Armand Jordana (New York )

Localisation is a powerful tool in proving and analysing various geometric inequalities, including isoperimertic inequality in the context of metric measure spaces. Its multi-dimensional generalisation is linked to optimal transport of vector measures and vector-valued Lipschitz maps. I shall present recent developments in this area: a partial affirmative answer to a conjecture of Klartag concerning partitions associated to Lipschitz maps on Euclidean space, and a negative answer to another conjecture of his concerning mass-balance condition for absolutely continuous vector measures. During the course of the talk I shall also discuss an intriguing notion of ghost subspaces related to the above mentioned partitions. 

We call affine logic the fragment of continuous logic in which the connectives are limited to linear combinations and the constants (but quantification is allowed, in the usual continuous form). This fragment has been introduced and studied by S.M. Bagheri, the first to observe that this is the appropriate framework to consider convex combinations of metric structures and, more generally, ultrameans, i.e., ultraproducts in which the ultrafilter is replaced by a finitely additive probability measure. Bagheri has shown that many fundamental results of continuous logic hold in affine logic in an appropriate form, including Łoś's theorem, the compactness theorem, and the Keisler--Shelah isomorphism theorem.

In affine logic, type spaces are compact convex sets. In this talk I will report on an ongoing work with I. Ben Yaacov and T. Tsankov, in which we initiate the study of extremal models in affine logic, i.e., those that only realize extreme types.

A branched covering between two surfaces looks like a regular covering map except for finitely many branching points, where some non-trivial ramification may occur. Informally speaking, the existence problem asks whether we can find a branched covering with prescribed behaviour around its branching points.

A variety of techniques have historically been employed to tackle this problem, ranging from studying representations of surface groups into symmetric groups to drawing "dessins d'enfant" on the covering surface. After introducing these techniques and explaining how they can be applied to the existence problem, I will briefly present a conjecture unexpectedly relating branched coverings and prime numbers.
 

Modular forms of slow growth admit a decomposition in terms of the eigenfunctions of the Laplacian operator in the Upper Half Plane. Whilst this technology has been used for many years in the context of Number Theory, it has only recently been used to further understand the partition function and the spectrum of Conformal Field Theories in 2d. In this talk, we’ll review the technology and how it has been applied to CFTs by several authors, as well as present a few new results.

Hirschman-Widder densities may be viewed as the probability density functions of positive linear combinations of independent and identically distributed exponential random variables. They also arise naturally in the study of Pólya frequency functions, which are integrable functions that give rise to totally positive Toeplitz kernels. This talk will introduce the class of Hirschman-Widder densities and discuss some of its properties. We will demonstrate connections to Schur polynomials and to orbital integrals. We will conclude by describing the rigidity of this class under composition with polynomial functions.

 This is joint work with Dominique Guillot (University of Delaware), Apoorva Khare (Indian Institute of Science, Bangalore) and Mihai Putinar (University of California at Santa Barbara and Newcastle University).

Computers have been used to process natural language for many years. This talk considers two historical examples of computers used rather to play with human language, one well-known and the other a new archival discovery: Strachey’s 1952 love letters program, and a poetry programming competition held at Newcastle University in 1968. Strachey’s program used random number generation to pick words to fit into a template, resulting in letters of varying quality, and apparently much amusement for Strachey. The poetry competition required the entrants, mostly PhD students, to write programs whose output or source code was in some way poetic: the entries displayed remarkable ingenuity. Various analyses of Strachey’s work depict it as a parody of attitudes to love, an artistic endeavour, or as a technical exploration. In this talk I will consider how these apply to the Newcastle competition and add my own interpretations.

Global singularity theory is a classical subject which classifies singularities of maps between manifolds, and describes topological reasons for their appearance. I will start with explaining a central problem of the subject regarding multipoint and multisingularity loci, then give an introduction into some recent major developments by Kazarian, Rimanyi, Szenes and myself.

In 2004, Diaconis and Gamburd computed statistics of secular coefficients in the circular unitary ensemble. They expressed the moments of the secular coefficients in terms of counts of magic squares. Their proof relied on the RSK correspondence. We'll present a combinatorial proof of their result, involving the characteristic map. The combinatorial proof is quite flexible and can handle other statistics as well. We'll connect the result and its proof to old and new questions in number theory, by formulating integer and function field analogues of the result, inspired by the Random Matrix Theory model for L-functions.

Partly based on the arXiv preprint https://arxiv.org/abs/2102.11966

Regularization of linear least squares problems is necessary in a variety of contexts. However, the optimal regularization parameter is usually unknown a priori and is often to be determined in an ad hoc manner, which may involve solving the problem for multiple regularization parameters. In this talk, we will discuss three randomized algorithms, building on the sketch-and-precondition framework in randomized numerical linear algebra (RNLA), to efficiently solve this set of problems. In particular, we consider preconditioners for a set of Tikhonov regularization problems to be solved iteratively. The first algorithm is a Cholesky-based algorithm employing a single sketch for multiple parameters; the second algorithm is SVD-based and improves the computational complexity by requiring a single decomposition of the sketch for multiple parameters. Finally, we introduce an algorithm capable of exploiting low-rank structure (specifically, low statistical dimension), requiring a single sketch and a single decomposition to compute multiple preconditioners with low-rank structure. This algorithm avoids the Gram matrix, resulting in improved stability as compared to related work.

In the first half of the talk, we will explore the concept of a characteristic class of a subvariety in a smooth ambient space. We will focus on the so-called stable envelope class,  in cohomology, K theory, and elliptic cohomology (due to Okoukov-Maulik-Aganagic). Stable envelopes have rich algebraic combinatorics, they are at the heart of enumerative geometry calculations, they show up in the study of associated (quantum) differential equations, and they are the main building blocks of constructing quantum group actions on the cohomology of moduli spaces.

In the second half of the talk, we will study a generalization of Nakajima quiver varieties called Cherkis’ bow varieties. These smooth spaces are endowed with familiar structures: holomorphic symplectic form, tautological bundles, torus action. Their algebraic combinatorics features a new powerful operation, the Hanany-Witten transition. Bow varieties come in natural pairs called 3d mirror symmetric pairs. A conjecture motivated by superstring theory predicts that stable envelopes on 3d mirror pairs are equal (in a sophisticated sense that involves switching equivariant and Kahler parameters). I will report on a work in progress, with T. Botta, to prove this conjecture.

Time-optimal control can be used to improve driving efficiency for autonomous
vehicles and it enables us explore vehicle and driver behaviour in extreme
situations. Due to the computational cost and limited scope of classical
optimal control methods we have seen new interest in applying reinforcement
learning algorithms to autonomous driving tasks.
In this talk we present methods for translating time-optimal vehicle control
problems into reinforcement learning environments. For this translation we
construct a sequence of environments, starting from the closest representation
of our optimisation problem, and gradually improve the environments reward
signal and feature quality. The trained agents we obtain are able to generalise
across different race tracks and obtain near optimal solutions, which can then
be used to speed up the solution of classical time-optimal control problems.

Combining physics with machine learning is a rapidly growing field of research. Thereby, most work focuses on leveraging machine learning methods to solve problems in physics. Here, however, we focus on the reverse direction of leveraging structure of physical systems (e.g. dynamical systems modeled by ODEs or PDEs) to construct novel machine learning algorithms, where the existence of highly desirable properties of the underlying method can be rigorously proved. In particular, we propose several physics-inspired deep learning architectures for sequence modelling as well as for graph representation learning. The proposed architectures mitigate central problems in each corresponding domain, such as the vanishing and exploding gradients problem for recurrent neural networks or the oversmoothing problem for graph neural networks. Finally, we show that this leads to state-of-the-art performance on several widely used benchmark problems.

When you ask someone what maths is, their answer will massively depend on how they’ve been exposed to maths up until that point. From a 10-year-old who will tell you it’s adding up numbers, to a Fields medalist who may say to you about the idea of abstraction of logical ideas, there is no clear consensus as to the “right” answer to this question. Our individual journeys as mathematicians give us a clear idea about what it means to us, and this affects how we then communicate our ideas to an audience of other mathematicians and the general public. However, a pitfall that we easily fall into as a result is forgetting that others can understand maths in a different way to ourselves, and by only offering our preferred perspective, we are missing out on the chance to effectively communicate our ideas.

In this talk, I will explore how our individual understanding of what mathematics is can shape our methods of communication. I will review which methods of communication mathematicians utilise, and show examples where each method does well, and not so well.  Examples of communication methods include writing equations, plotting graphs, creating diagrams and storytelling. Given this, I will cover how by using a collection of these different methods, you can increase the impact of your research by engaging with the various different mindsets your audience may have on what mathematics is.

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 the plane, we know that area of a set is monotone with respect to the inclusion but perimeter fails, in general. If we consider only bounded and convex sets, then also the perimeter is monotone. This property allows us to estimate the minimum number of convex components of a nonconvex set.

When studying integral functionals of the calculus of variations, convexity with respect to minors of the Jacobian matrix is a nice tool for proving existence and regularity of minimizers.

Sometimes it happens that the infimum of a functional on a set is less then the infimum taken on a dense subset: we usually refer to it as Lavrentiev phenomenon. In order to avoid it, convexity helps a lot.

Gerbes are geometric objects describing the third integer cohomology group of a manifold and the B-field in string theory. Like line bundles, they admit connections and gauge symmetries. In contrast to line bundles, however, there are now isomorphisms between gauge symmetries: the gauge group of a gerbe is a smooth 2-group. Starting from a hands-on example, I will explain gerbes and some of their properties. The main topic of this talk will then be the study of symmetries of gerbes on a manifold with G-action, and how these symmetries assemble into smooth 2-group extensions of G. In the last part, I will survey how this construction can be used to provide a new smooth model for the String group, via a theory of ∞-categorical principal bundles and group extensions.

We consider the problem of finding the best memoryless stochastic policy for an infinite-horizon partially observable Markov decision process (POMDP) with finite state and action spaces with respect to either the discounted or mean reward criterion. We show that the (discounted) state-action frequencies and the expected cumulative reward are rational functions of the policy, whereby the degree is determined by the degree of partial observability. We then describe the optimization problem as a linear optimization problem in the space of feasible state-action frequencies subject to polynomial constraints that we characterize explicitly. This allows us to address the combinatorial and geometric complexity of the optimization problem using tools from polynomial optimization. In particular, we estimate the number of critical points and use the polynomial programming description of reward maximization to solve a navigation problem in a grid world. The talk is based on recent work with Johannes Müller.

The so called Drinfeld conjecture states that the complement to very stable bundles has pure codimension one in the moduli space of vector bundles. In this talk I will explain a constructive proof in rank three, and discuss if/how it generalises to wobbly fixed points of the nilpotent cone as defined by Hausel and Hitchin. This is joint work with Pauly (Nice).

In this talk I will describe a systematic approach, introduced in our recent work 2111.08022, to construct Lagrangian descriptions for a class of strongly interacting N=2 SCFTs. I will review the main ingredients of these constructions, namely brane tilings and the connection to gauge theories. For concreteness, I will then specialize to the case of the simplest of such geometrical setups, as in the paper, even though our approach should be much more general. I will comment on some low rank examples of the theories we built, that are well understood by (many) alternative approaches and conclude with some open questions and ideas for future directions to explore.

I will report on my most recent results  with Jeremie Szeftel and Elena Giorgi which conclude the proof of the nonlinear, unconditional, stability of slowly rotating Kerr metrics. The main part of the proof, announced last year, was conditional on results concerning boundedness and decay estimates for nonlinear wave equations. I will review the old results and discuss how the conditional results can now be fully established.