Past

We study a group theoretic analog of Dehn fillings of 3-manifolds and derive a spectral sequence to compute the cohomology of Dehn fillings of hyperbolically embedded subgroups. As applications, we generalize the results of Dahmani-Guirardel-Osin and Hull on SQ-universality and common quotients of acylindrically hyperbolic groups by adding cohomological finiteness conditions. This is a joint work with Nansen Petrosyan.

In the talk I will survey the fast growing field of metric measure spaces satisfying a lower bound on Ricci Curvature, in a synthetic sense via optimal transport. Particular emphasis will be given to discuss how such (possibly non-smooth) spaces naturally (and usefully) extend the class of smooth Riemannian manifolds with Ricci curvature bounded below.

We will discuss recent progress in understanding (ordinary and generalized) symmetries, dualities and classification of superconformal field theories in 5d and 6d, which involves the study of M-theory and F-theory compactified on Calabi-Yau threefolds.

We consider weakly-coupled QFT in AdS at finite temperature. We compute the holographic thermal two-point function of scalar operators in the boundary theory. We present analytic expressions for leading corrections due to local quartic interactions in the bulk, with an arbitrary number of derivatives and for any number of spacetime dimensions. The solutions are fixed by judiciously picking an ansatz and imposing consistency conditions. The conditions include analyticity properties, consistency with the operator product expansion, and the Kubo-Martin-Schwinger condition. For the case without any derivatives we show agreement with an explicit diagrammatic computation. The structure of the answer is suggestive of a thermal Mellin amplitude. Additionally, we derive a simple dispersion relation for thermal two-point functions which reconstructs the function from its discontinuity.

Talking maths on YouTube is a lot of fun. Your audience will contain maths enthusiasts, young people, and the general public. These are people who are interested in what you have to say, and want to learn something new. Maths videos on YouTube can be used to teach maths, or to just show people something interesting. Making videos doesn't have to be technically difficult, but is good practice in explaining difficult concepts in clear and succinct ways. In this session we will discuss how to make your first YouTube video, including questions about content, presentation and video making.

Dr James Grime started making his first maths YouTube videos while working as a postdoc in 2008. James has made maths videos with Cambridge University, the Royal Institution, and MathsWorldUK, and is also a presenter on the popular YouTube channel Numberphile, which now has over 3 million subscribers worldwide.

The session will be a panel discussion addressing practical aspects of doing a research degree. We will take questions from the audience so will discuss whatever people wish to ask us, but we expect to talk about the process of applying, why you might want to consider doing a research degree, the experience of doing research, and what people do after they have completed their degree.

Signalling pathways can be modelled as a biochemical reaction network. When the kinetics are to follow mass-action kinetics, the resulting
mathematical model is a polynomial dynamical system. I will overview approaches to analyse these models with steady-state data using
computational algebraic geometry and statistics. Then I will present how to analyse such models with time-course data using differential
algebra and geometry for model identifiability. Finally, I will present how topological data analysis can be help distinguish models
and data.

When faced with a data analysis, learning, or statistical inference problem, the amount and quality of data available fundamentally determines whether such tasks can be performed with certain levels of accuracy. With the growing size of datasets however, it is crucial not only that the underlying statistical task is possible, but also that is doable by means of efficient algorithms. In this talk we will discuss methods aiming to establish limits of when statistical tasks are possible with computationally efficient methods or when there is a fundamental «Statistical-to-Computational gap›› in which an inference task is statistically possible but inherently computationally hard. We will focus on Hypothesis Testing and the ``Low Degree Method'' and also address hardness of certification via ``quiet plantings''. Guiding examples will include Sparse PCA, bounds on the Sherrington Kirkpatrick Hamiltonian, and lower bounds on Chromatic Numbers of random graphs.

Deep convolutional networks have spectacular performances that remain mostly not understood. Numerical experiments show that they classify by progressively concentrating each class in separate regions of a low-dimensional space. To explain these properties, we introduce a concentration and separation mechanism with multiscale tight frame contractions. Applications are shown for image classification and statistical physics models of cosmological structures and turbulent fluids.

The development of high frequency and algorithmic trading allowed to considerably reduce the bid ask spread by increasing liquidity in limit order books. Beyond the problem of optimal placement of market and limit orders, the possibility to cancel orders for free leaves room for price manipulations, one of such being spoofing. Detecting spoofing from a regulatory viewpoint is challenging due to the sheer amount of orders and difficulty to discriminate between legitimate and manipulative flows of orders. However, it is empirical evidence that volume imbalance reflecting offer and demand on both sides of the limit order book has an impact on subsequent price movements. Spoofers use this effect to artificially modify the imbalance by posting limit orders and then execute market orders at subsequent better prices while canceling at a high speed their previous limit orders. In this work we set up a model to determine where a spoofer would place its limit orders to maximize its gains as a function of the imbalance impact on the price movement. We study the solution of this non local optimization problem as a function of the imbalance. With this at hand, we calibrate on real data from TMX the imbalance impact (as a function of its depth) on the resulting price movement. Based on this calibration and theoretical results, we then provide some methods and numerical results as how to detect in real time some eventual spoofing behavior based on Wasserstein distances. Joint work with Tao Xuan (SJTU), Ling Lan (SJTU) and Andrew Day (Western University)
=====================================================================

Materials made from a mixture of liquid and solid are, instinctively, very obviously complex. From dilatancy (the reason wet sand becomes dry when you step on it) to extreme shear-thinning (quicksand) or shear-thickening (cornflour oobleck) there is a wide range of behaviours to explain and predict. I'll discuss the seemingly simple case of solid spheres suspended in a Newtonian fluid matrix, which still has plenty of surprises up its sleeve.

Let $k$ be a field and $A$ a $k$-algebra. The classical Quillen's Lemma states that if $A$ if is equipped with an exhaustive filtration such that the associated graded ring is commutative and finitely generated $k$-algebra then for any finitely generated $A$-module $M$, every element of the endomorphism ring of $M$ is algebraic over $k$. In particular, Quillen's Lemma may be applied to the enveloping algebra of a finite dimensional Lie algebra. I aim to present an affinoid version of Quillen's Lemma which strengthness a theorem proved by Ardakov and Wadsley. Depending on time, I will show how this leads to an (almost) classification of the primitive spectrum of the affinoid enveloping algebra of a semisimple Lie algebra.

Whitney elements on simplices are perhaps the most widely used finite elements in computational electromagnetics. They offer the simplest construction of polynomial discrete differential forms on simplicial complexes. Their associated degrees of freedom (dofs) have a very clear physical meaning and give a recipe for discretizing physical balance laws, e.g., Maxwell’s equations. As interest grew for the use of high order schemes, such as hp-finite element or spectral element methods, higher-order extensions of Whitney forms have become an important computational tool, appreciated for their better convergence and accuracy properties. However, it has remained unclear what kind of cochains such elements should be associated with: Can the corresponding dofs be assigned to precise geometrical elements of the mesh, just as, for instance, a degree of freedom for the space of Whitney 1-forms belongs to a specific edge? We address this localization issue. Why is this an issue? The existing constructions of high order extensions of Whitney elements follow the traditional FEM path of using higher and higher “moments” to define the needed dofs. As a result, such high order finite k-elements in d dimensions include dofs associated to q-simplices, with k < q ≤ d, whose physical interpretation is obscure. The present paper offers an approach based on the so-called “small simplices”, a set of subsimplices obtained by homothetic contractions of the original mesh simplices, centered at mesh nodes (or more generally, when going up in degree, at points of the principal lattice of each original simplex). Degrees of freedom of the high-order Whitney k-forms are then associated with small simplices of dimension k only.  We provide an explicit  basis for these elements on simplices and we justify this approach from a geometric point of view (in the spirit of Hassler Whitney's approach, still successful 30 years after his death).   

A link for this talk will be sent to our mailing list a day or two in advance.  If you are not on the list and wish to be sent a link, please send email to @email.

A dagger category is a category where for every morphism f:x --> y there is a chosen adjoint f*:y --> x, as for example in the category of Hilbert spaces. I will explain this definition in elementary terms and give a few example. The only prerequisites for this talk are the notion of category, functor, and Hilbert space.

Dagger categories are a great categorical framework for some concepts from functional analysis such as C*-algebras and they also allow us to state Atiyah's definition unitary topological field theories in categorical lanugage. There is however a problem with dagger categories: they are what category theorists like to call 'evil'. This is isn't really meant as a moral judgement, it just means that many ways of thinking about ordinary categories don't quite translate to dagger categories.

For example, not every fully faithful and essentially surjective dagger functor is also a dagger equivalence. I will present a notion of 'indefinite completion' that I came up with to describe dagger categories in less 'evil' terms. (Those of you who know Karoubi completion will see a lot of similarities.) I'll also explain how this can be used to compute categories of dagger functors, and more specifically groupoids of unitary TFTs.

Leighton's Theorem states that if two finite graphs have a common universal cover then they have a common finite cover. I will explore various ways in which this result can and can't be extended.

In long-range percolation on $\mathbb{Z}^d$, each potential edge $\{x,y\}$ is included independently at random with probability roughly $\beta\|x-y\|-d-\alpha$, where $\alpha > 0$ controls how long-range the model is and $\beta > 0$ is an intensity parameter. The smaller $\alpha$ is, the easier it is for very long edges to appear. We are normally interested in fixing $\alpha$ and studying the phase transition that occurs as $\beta$ is increased and an infinite cluster emerges. Perhaps surprisingly, the phase transition for long-range percolation is much better understood than that of nearest neighbour percolation, at least when $\alpha$ is small: It is a theorem of Noam Berger that if $\alpha < d$ then the phase transition is continuous, meaning that there are no infinite clusters at the critical value of $\beta$. (Proving the analogous result for nearest neighbour percolation is a notorious open problem!) In my talk I will describe a new, quantitative proof of Berger's theorem that yields power-law upper bounds on the distribution of the cluster of the origin at criticality.
    As a part of this proof, I will describe a new universal inequality stating that on any graph, the maximum size of a percolation cluster is of the same order as its median with high probability. This inequality can also be used to give streamlined new proofs of various classical results on e.g. Erdős-Rényi random graphs, which I will hopefully have time to talk a little bit about also.

I will talk about the joint moments of characteristic polynomials of random unitary matrices and their derivatives. In joint work with Jon Keating and Jon Warren we establish the asymptotics of these quantities for general real values of the exponents as the size N of the matrix goes to infinity. This proves a conjecture of Hughes from 2001. In subsequent joint work with Benjamin Bedert, Mustafa Alper Gunes and Arun Soor we focus on the leading order coefficient in the asymptotics, we connect this to Painleve equations for general values of the exponents and obtain explicit expressions corresponding to the so-called classical solutions of these equations.

Let $G$ be a connected reductive algebraic group, and let $G(\mathbb{F}_q)$ be its group of $\mathbb{F}_q$-rational points. Denote by $\mathrm{Irr}(G(\mathbb{F}_q))$ the set of (equivalence classes) of irreducible finite-dimensional representations. Deligne and Lusztig defined a finite subset $$\mathrm{Unip}(G(\mathbb{F}_q)) \subset \mathrm{Irr}_{\mathrm{fd}}(G(\mathbb{F}_q))$$ 
of unipotent representations. These representations play a distinguished role in the representation theory of $G(\mathbb{F}_q)$. In particular, the classification of $\mathrm{Irr}_{\mathrm{fd}}(G(\mathbb{F}_q))$ reduces to the classification of $\mathrm{Unip}(G(\mathbb{F}_q))$. 

Now replace $\mathbb{F}_q$ with a local field $k$ and replace $\mathrm{Irr}_{\mathrm{fd}}(G(\mathbb{F}_q))$ with $\mathrm{Irr}_{\mathrm{u}}(G(k))$ (irreducible unitary representations). Vogan has predicted the existence of a finite subset 
$$\mathrm{Unip}(G(k)) \subset \mathrm{Irr}_{\mathrm{u}}(G(k))$$ 
which completes the following analogy
$$\mathrm{Unip}(G(k)) \text{ is to } \mathrm{Irr}_{\mathrm{u}}(G(k)) \text{ as } \mathrm{Unip}(G(\mathbb{F}_q)) \text{ is to } \mathrm{Irr}_{\mathrm{fd}}(G(\mathbb{F}_q)).$$
In this talk I will propose a definition of $\mathrm{Unip}(G(k))$ when $k = \mathbb{C}$. The definition is geometric and case-free. The representations considered include all of Arthur's, but also many others. After sketching the definition and cataloging its properties, I will explain a classification of $\mathrm{Unip}(G(\mathbb{C}))$, generalizing the well-known result of Barbasch-Vogan for Arthur's representations. Time permitting, I will discuss some speculations about the case of $k=\mathbb{R}$.

This talk is based on forthcoming joint work with Ivan Loseu and Dmitryo Matvieievskyi.

(joint work with T. Kania, Academy of Sciences of the Czech Republic, Prague)
In this talk we discuss our recent result on the inverse eigenvalue problem for symmetric doubly stochastic matrices. 
Namely, we provide a new sufficient condition for a list of real numbers to be the spectrum of a symmetric doubly stochastic matrix. 
In our construction of such matrices, we employ the eigenvectors of the transition probability matrix of a simple symmetric random walk on the circle. 
We also demonstrate a simple algorithm for generating random doubly stochastic matrices based on our construction. Examples will be provided.

I will present work in progress with D. Gayet and F. Pouran (Grenoble) to establish Russo-Seymour-Welsh (RSW) estimates for 2d statistical mechanics models that do not satisfy the FKG inequality. RSW states that critical percolation has no characteristic length, in the sense that large rectangles are crossed by an open path with a probability that is bounded below by a function of their shape, but uniformly in their size; this ensures the polynomial decay of many relevant quantities and opens the way to deeper understanding of the critical features of the model. All the standard proofs of RSW rely on the FKG inequality, i.e. on the positive correlation between increasing events; we establish the stability of RSW under small perturbations that do not preserve FKG, which extends it for instance to the high-temperature anti-ferromagnetic Ising model.

Subfactors and K-theory are useful mechanisms for understanding modular tensor categories and conformal field theories. As part of this programme, one issue to try and construct or reconstruct a conformal field theory as the representation theory of a conformal net of algebras, or as a vertex operator algebra from a given abstractly presented modular tensor category. Orbifold models play an important role and orbifolds of Tambara-Yamagami systems are relevant to understanding the double of the Haagerup as a conformal field theory. This is joint work with Andreas Aaserud, Terry Gannon and Ulrich Pennig.

I will review recent works on geometries underlying scattering amplitudes of (certain generalizations of) particles and strings  Tree amplitudes of a cubic scalar theory are given by "canonical forms" of the so-called ABHY associahedra defined in kinematic space. The latter can be naturally extended to generalized associahedra for finite-type cluster algebra, and for classical types their canonical forms give scalar amplitudes through one-loop order. We then consider vast generalizations of string amplitudes dubbed “stringy canonical forms”, and in particular "cluster string integrals" for any Dynkin diagram, which for type A reduces to usual string amplitudes. These integrals enjoy remarkable factorization properties at finite $\alpha'$, obtained simply by removing nodes of the Dynkin diagram; as $\alpha'\rightarrow 0$ they reduce to canonical forms of generalized associahedra, or the aforementioned tree and one-loop scalar amplitudes.

It is one of the most challenging issues in applied mathematics to approximately solve high-dimensional partial differential equations (PDEs) and most of the numerical approximation methods for PDEs in the scientific literature suffer from the so-called curse of dimensionality (CoD) in the sense that the number of computational operations employed in the corresponding approximation scheme to obtain an  approximation precision $\varepsilon >0$ grows exponentially in the PDE dimension and/or the reciprocal of $\varepsilon$. Recently, certain deep learning based approximation methods for PDEs have been proposed  and various numerical simulations for such methods suggest that deep neural network (DNN) approximations might have the capacity to indeed overcome the CoD in the sense that  the number of real parameters used to describe the approximating DNNs  grows at most polynomially in both the PDE dimension $d \in  \N$ and the reciprocal of the prescribed approximation accuracy $\varepsilon >0$. There are now also a few rigorous mathematical results in the scientific literature which  substantiate this conjecture by proving that  DNNs overcome the CoD in approximating solutions of PDEs.  Each of these results establishes that DNNs overcome the CoD in approximating suitable PDE solutions  at a fixed time point $T >0$ and on a compact cube $[a, b]^d$ but none of these results provides an answer to the question whether the entire PDE solution on $[0, T] \times [a, b]^d$ can be approximated by DNNs without the CoD. 
In this talk we show that for every $a \in \R$, $ b \in (a, \infty)$ solutions of  suitable  Kolmogorov PDEs can be approximated by DNNs on the space-time region $[0, T] \times [a, b]^d$ without the CoD. 

We discuss the problem in representation theory of decomposing restricted representations. We start classically with the symmetric groups via Young diagrams and Young tableaux, and then move into the world of Lie groups. These problems have connections with both physics and number theory, and if there is time I will discuss the Gan-Gross-Prasad conjectures which predict results on restrictions for algebraic groups over both local and global fields. The pre-requisites will build throughout the talk, but it should be accessible to anyone with some knowedge of both finite groups and Lie groups.