Past

4d N=2 SCFTs are extremely important structures. In the first minitalk we will introduce them, then we will show three areas of mathematics with which this area of physics interacts. The minitalks are independent. The talk will be hybrid, with teams link below.

The junior Geometry and Physics seminar aims to bring together people from both areas, giving talks which are interesting and understandable to both.

Website: https://sites.google.com/view/oxfordpandg/physics-and-geometry-seminar

Teams link: https://www.google.com/url?q=https%3A%2F%2Fteams.microsoft.com%2Fl%2Fme…

Free fermion chains are particularly simple exactly solvable models. Despite this, typically one can find closed expressions for physically important correlators only in certain asymptotic limits. For a particular class of chains, I will show that we can apply Day's formula and Gorodetsky's formula for Toeplitz determinants with rational generating function. This leads to simple closed expressions for determinantal order parameters and the characteristic polynomial of the correlation matrix. The latter result allows us to prove that the ground state of the chain has an exact matrix-product state representation.

I will present a four-term exact sequence relating the cohomology of a fibration to the cohomology of an open set obtained by removing the preimage of a general linear section of the base. This exact sequence respects three filtrations, the Hodge, weight, and perverse Leray filtrations, so that it is an exact sequence of mixed 
Hodge structures on the graded pieces of the perverse Leray filtration. I claim that this sequence should be thought of as a mirror to the Clemens-Schmid sequence describing the structure of a degeneration and formulate a "mirror P=W" conjecture relating the filtrations on each side. Finally, I will present evidence for this conjecture coming from the K3 surface setting. This is joint work with Charles F. Doran.

Over the last few decades, scientists have conducted extensive research on parallelisation in time, which appears to be a promising way to provide additional parallelism when parallelisation in space saturates before all parallel resources have been used. For the simulations of interest to the Culham Centre of Fusion Energy (CCFE), however, time parallelisation is highly non-trivial, because the exponential divergence of nearby trajectories makes it hard for time-parallel numerical integration to achieve convergence. In this talk we present our results for the convergence analysis of parallel-in-time algorithms on nonlinear problems, focussing on what is widely accepted to be the prototypical parallel-in-time method, the Parareal algorithm. Next, we introduce a new error function to measure convergence based on the maximal Lyapunov exponents, and show how it improves the overall parallel speedup when compared to the traditional check used in the literature. We conclude by mentioning how the above tools can help us design and analyse a novel algorithm for the long-time integration of chaotic systems that uses time-parallel algorithms as a sub-procedure.

Suppose there are $n$ students in a class. But assume that not everybody is friends with everyone else, and there is a graph which determines the friendship structure. What is the chance that there are two friends in this class, both with birthdays on October 12? More generally, given a simple labelled graph $G_n$ on $n$ vertices, color each vertex with one of $c=c_n$ colors chosen uniformly at random, independent from other vertices. We study the question: what is the number of monochromatic edges of color 1?

As it turns out, the limiting distribution has three parts, the first and second of which are quadratic and linear functions of a homogeneous Poisson point process, and the third component is an independent Poisson. In fact, we show that any distribution limit must belong to the closure of this class of random variables. As an application, we characterize exactly when the limiting distribution is a Poisson random variable.

This talk is based on joint work with Bhaswar Bhattacharya and Somabha Mukherjee.

“The Royal Swedish Academy of Sciences has today decided to award the 2021 Nobel Prize in Physics for ground-breaking contributions to our understanding of complex physical systems”

Last Tuesday this announcement got many in our community very excited: never before had the Nobel prize been awarded to a topic so closely related to Network Science. We will try to understand the contributions that have led to this Nobel Prize announcement and their ties with networks science. The presentation will be held by Erik Hörmann, who has been lucky enough to have had the honour and pleasure of studying and working with one of the awardees, Professor Giorgio Parisi, before joining the Mathematical Institute.

The solution of systems of linear(ized) equations lies at the heart of many problems in Scientific Computing. In particular for large systems, iterative methods are a primary approach. For many symmetric (or self-adjoint) systems, there are effective solution methods based on the Conjugate Gradient method (for definite problems) or minres (for indefinite problems) in combination with an appropriate preconditioner, which is required in almost all cases. For nonsymmetric systems there are two principal lines of attack: the use of a nonsymmetric iterative method such as gmres, or tranformation into a symmetric problem via the normal equations. In either case, an appropriate preconditioner is generally required. We consider the possibilities here, particularly the idea of preconditioning the normal equations via approximations to the original nonsymmetric matrix. We highlight dangers that readily arise in this approach. Our comments also apply in the context of linear least squares problems as we will explain.

The non-compact exceptional simple group G_2* turns out to be the symmetry group of quantized twistor theory. Certain implications of this remarkable fact will be explored in this talk.

In 1973, Serre defined $p$-adic modular forms as limits of modular forms, and constructed the Leopoldt-Kubota $L$-function as the constant term of a limit of Eisenstein series. This was extended by Deligne-Ribet to totally real number fields, and Lauder and Vonk have developed an algorithm for interpolating $p$-adic $L$-functions of such fields using Serre's idea. We explain what an $L$-function is and why you should care, and then move on to giving an overview of the algorithm, extensions, and applications.

Modelling joint dynamics of liquid vanilla options is crucial for arbitrage-free pricing of illiquid derivatives and managing risks of option trade books. This paper develops a nonparametric model for the European options book respecting underlying financial constraints and while being practically implementable. We derive a state space for prices which are free from static (or model-independent) arbitrage and study the inference problem where a model is learnt from discrete time series data of stock and option prices. We use neural networks as function approximators for the drift and diffusion of the modelled SDE system, and impose constraints on the neural nets such that no-arbitrage conditions are preserved. In particular, we give methods to calibrate neural SDE models which are guaranteed to satisfy a set of linear inequalities. We validate our approach with numerical experiments using data generated from a Heston stochastic local volatility model, and will discuss some initial results using real data.

Based on joint work with Christoph Reisinger and Sheng Wang

In this talk we will introduce Leary and Minasyan's CAT(0) but not biautomatic groups as lattices in a product of a Euclidean space and a tree.  We will then investigate properties of general lattices in that product space.  We will also consider a construction of lattices in a Salvetti complex for a right-angled Artin group and a Euclidean space.  Finally, if time permits we will also discuss a "hyperbolic Leary–Minasyan group" and some work in progress with Motiejus Valiunas towards an application.

Free boundary minimal surfaces are a notoriously elusive object in geometric analysis. From 2011, Fraser and Schoen's research program found a relationship between free boundary minimal surfaces in unit balls and metrics which maximise the first nontrivial Steklov eigenvalue. In this talk, I will explain how we can adapt homogenisation theory, a branch of applied mathematics, to a geometric setting in order to obtain surfaces with first Steklov eigenvalue as large as possible, and how it leads to the existence of free boundary minimal surfaces which were previously thought not to exist.

Scattering amplitudes in N=4 super-Yang-Mills theory are known to be functions of cluster variables of Gr(4,n) and certain algebraic functions of cluster variables. In this talk we give an overview of the known cluster algebraic structure of both tree amplitudes and the symbol of loop amplitudes. We suggest an algorithm for computing symbol alphabets by solving matrix equations of the form C.Z = 0 associated with plabic graphs. These matrix equations associate functions on Gr(m,n) to parameterizations of certain cells of Gr_+ (k,n) indexed by plabic graphs. We are able to reproduce all known algebraic functions of cluster variables appearing in known symbol alphabets. We further show that it is possible to obtain all rational symbol letters (in fact all cluster variables) by solving C.Z = 0 if one allows C to be an arbitrary cluster parameterization of the top cell of Gr_+ (n-4,n). Finally we discuss a property of the symbol called cluster adjacency.

The SI model is the most basic of all compartmental models used to describe the spreading of information through a population. In this talk we will present a mathematical formalism to solve the SI model on generic networks. Our methods rely on a tensor product formulation of the dynamical spreading process, inspired by many-body quantum systems. Here we will focus on time-dependent expectation values for the state of individual nodes, which can be obtained from contributions of subgraphs of the network. We show how to compute these contributions systematically and derive a set of symmetry relations among subgraphs of differing topologies. We conclude by comparing our results for small sample networks to Monte-Carlo simulations and mean-field approximations.

arXiv link: https://arxiv.org/abs/2109.03530

Stochastic differential equations (SDEs) on compact foliated spaces were introduced a few years ago. As a corollary, a leafwise Brownian motion on a compact foliated space was obtained as a solution to an SDE. In this work we construct stochastic flows associated with the SDEs by using rough path theory, which is something like a 'deterministic version' of Ito's SDE theory.

This is joint work with Kiyotaka Suzaki.

Although a multidimensional data array can be very large, it may contain coherence patterns much smaller in size. For example, we may need to detect a subset of genes that co-express under a subset of conditions. In this presentation, we discuss our recently developed co-clustering algorithms for the extraction and analysis of coherent patterns in big datasets. In our method, a co-cluster, corresponding to a coherent pattern, is represented as a low-rank tensor and it can be detected from the intersection of hyperplanes in a high dimensional data space. Our method has been used successfully for DNA and protein data analysis, disease diagnosis, drug therapeutic effect assessment, and feature selection in human facial expression classification. Our method can also be useful for many other real-world data mining, image processing and pattern recognition applications.

We will present the precise late-time asymptotics for scalar fields on both extremal and sub-extremal black holes including the full Reissner-Nordstrom family and the subextremal Kerr family. Asymptotics for higher angular modes will be presented for all cases. Applications in observational signatures will also be discussed. This work is joint with Y. Angelopoulos (Caltech) and D. Gajic (Cambridge)

I will present work in progress with Erik Panzer, Matteo Parisi and Ömer Gürdoğan on the analytic structure of Feynman(esque) integrals: We consider integrals of meromorphic differential forms over relative cycles in a compact complex manifold, the underlying geometry encoded in a certain (parameter dependant) subspace arrangement (e.g. Feynman integrals in their parametric representation). I will explain how the analytic struture of such integrals can be studied via methods from differential topology; this is the seminal work by Pham et al (using tools and methods developed by Leray, Thom, Picard-Lefschetz etc.). Although their work covers a very general setup, the case we need for Feynman integrals has never been worked out in full detail. I will comment on the gaps that have to be filled to make the theory work, then discuss how much information about the analytic structure of integrals can be derived from a careful study of the corresponding subspace arrangement.

This is a joint GR-QFT seminar, to celebrate in advance the 90th birthday of Roger Penrose later in the summer, comprising 9 talks on conformal cyclic cosmology.  The provisional schedule is as follows:

11:00 Roger Penrose (Oxford, UK) : The Initial Driving Forces Behind CCC

11:10 Paul Tod (Oxford, UK) : Questions for CCC

11:20 Vahe Gurzadyan (Yerevan, Armenia): CCC predictions and CMB

11:30 Krzysztof Meissner (Warsaw, Poland): Perfect fluids in CCC

11:40 Daniel An (SUNY, USA) : Finding information in the Cosmic Microwave Background data

11:50 Jörg Frauendiener (Otago, New Zealand) : Impulsive waves in de Sitter space and their impact on the present aeon

12:00 Pawel Nurowski (Warsaw, Poland and Guangdong Technion, China): Poincare-Einstein expansion and CCC

12:10 Luis Campusano (FCFM, Chile) : (Very) Large Quasar Groups

12:20 Roger Penrose (Oxford, UK) : What has CCC achieved; where can it go from here?