Past events

Modular curves play a key role in the Langlands programme, being the simplest example of so-called Shimura varieties.  Their less famous cousins, Shimura curves, are also very interesting, and very concrete. 
In this talk I will give a gentle introduction to the arithmetic of Shimura curves, with lots of explicit examples. Time permitting, I will say something about recent work about intersection numbers of geodesics on Shimura curves.

Involutive knot Floer homology, a refinement of knot Floer theory, is a powerful knot invariant which was used to solve several long-standing problems, including the one-is-not-enough result for 4-manifolds with boundary. In this talk, we show that if the involutive knot Floer homology of a knot K admits an invariant splitting, then the induced splitting if the knot Floer homology of P(K), for any pattern P, can be made invariant under its \iota_K involution. As an application, we construct an infinite family of examples of pairs of exotic contractible 4-manifolds which survive one stabilization, and observe that some of them are potential candidates for surviving two stabilizations.
 

Mathematicians have been interested in the problem of compactifying the Jacobian variety of curves since the mid XIX century. In this talk we will discuss how all 'reasonable' compactified Jacobians of nodal curves can be classified combinatorically. This suffices to obtain a combinatorial classification of all 'reasonable' compactified universal (over the moduli spaces of stable curves) Jacobians. This is a joint work with Orsola Tommasi.

When the data is large, or comes in a streaming way, randomized iterative methods provide an efficient way to solve a variety of problems, including solving linear systems, finding least square solutions, solving feasibility problems, and others. Randomized Kaczmarz algorithm for solving over-determined linear systems is one of the popular choices due to its efficiency and its simple, geometrically intuitive iterative steps. 
In challenging cases, for example, when the condition number of the system is bad, or some of the equations contain large corruptions, the geometry can be also helpful to augment the solver in the right way. I will discuss our recent work with Michal Derezinski and Jackie Lok on Kaczmarz-based algorithms that use external knowledge about the linear system to (a) accelerate the convergence of iterative solvers, and (b) enable convergence in the highly corrupted regime.

Join us for a discussion about preparing for PhD and PostDoc Interviews. We will be talking to Melanie Rupflin and Mura Yakerson.

This talk concerns some ideas around the question of when a *-homomorphism into a quotient C*-algebra lifts. Lifting of *-homomorphisms arises prominently in the notions of projectivity and semiprojectivity, which in turn are closely related to stability of relations. Blackadar recently defined the notions of l-open and l-closed C*-algebras, making use of the topological space of *-homomorphisms from a C*-algebra A to another C*-algebra B, with the point-norm topology. I will discuss these properties and present new characterizations of them, which lead to solutions of some problems posed by Blackadar. This is joint work with Dolapo Oyetunbi.

We present a new formulation of string and particle amplitudes that emerges from simple one-dimensional models. The key is a new way to parametrize the positive part of Teichmüller space. It also builds on the results of Mirzakhani for computing Weil-Petterson volumes. The formulation works at all orders in the perturbation series, including non-planar contributions. The relationship between strings and particles is made manifest as a "tropical limit". The results are well adapted to studying the scattering of large numbers of particles or amplitudes at high loop order. The talk will in part cover results from arXiv:2309.15913, 2311.09284.

This event is free but requires prior registration. To register, please click here.

Abstract
In the contemporary AI landscape, Large Language Models (LLMs) stand out as game-changers. They redefine not only how we interact with computers via natural language but also how we identify and extract insights from vast, complex datasets. This presentation delves into the nuances of training and customizing LLMs, with a focus on their applications to quantitative finance.


About the speaker
Ioana Boier is a senior principal solutions architect at Nvidia. Her background is in Quantitative Finance and Computer Science. Prior to joining Nvidia, she was the Head of Quantitative Portfolio Solutions at Alphadyne Asset Management, and led research teams at Citadel LLC, BNP Paribas, and IBM T.J. Watson Research. She has a Ph.D. in Computer Science from Purdue University and is the author of over 30 peer-reviewed publications, 15 patents, and the winner of several awards for applied research delivered into products.
View her LinkedIn page

Frontiers in Quantitative Finance is brought to you by the Oxford Mathematical and Computational Finance Group and sponsored by CitiGroup and Mosaic SmartData.
 

One of the fundamental problems in representation theory is determining the representation type of algebras. In this talk, we will introduce the representation type of cyclotomic quiver Hecke algebras, also known as cyclotomic Khovanov-Lauda-Rouquier algebras, especially in affine type A and affine type C. Our main result relies on novel constructions of the maximal dominant weights of integrable highest weight modules over quantum groups. This talk is based on collaborations with Susumu Ariki, Berta Hudak, and Linliang Song.

Title: Elliptic curves and modularity

Abstract: The goal of this talk is to give you a glimpse of the Langlands program, a central topic at the intersection of algebraic number theory, algebraic geometry and representation theory. I will focus on a celebrated instance of the Langlands correspondence, namely the modularity of elliptic curves. In the first part of the talk, I will give an explicit example, discuss the different meanings of modularity for rational elliptic curves, and mention applications. In the second part of the talk, I will discuss what is known about the modularity of elliptic curves over more general number fields.

The goal of this talk is to give you a glimpse of the Langlands program, a central topic at the intersection of algebraic number theory, algebraic geometry and representation theory. I will focus on a celebrated instance of the Langlands correspondence, namely the modularity of elliptic curves. In the first part of the talk, I will give an explicit example, discuss the different meanings of modularity for rational elliptic curves, and mention applications. In the second part of the talk, I will discuss what is known about the modularity of elliptic curves over more general number fields.

Pseudo metrics between persistence modules can be defined starting from Noise Systems [1].  Such metrics are used to compare the modules directly or to extract stable vectorisations. While the stability property directly follows from the axioms of Noise Systems, finding algorithms or closed formulas to compute the distances or associated vectorizations  is often a difficult problem, especially in the multi-parameter setting. In this seminar I will show how extra properties of Noise Systems can be used to define algorithms. In particular I will describe how to compute stable vectorisations with respect to Wasserstein distances [2]. Lastly I will discuss ongoing work (with D. Lundin and R. Corbet) for the computation of a geometric distance (the Volume Noise distance) and associated invariants on interval modules.

[1] M. Scolamiero, W. Chachólski, A. Lundman, R. Ramanujam, S. Oberg. Multidimensional Persistence and Noise, (2016) Foundations of Computational Mathematics, Vol 17, Issue 6, pages 1367-1406. doi:10.1007/s10208-016-9323-y.

[2] J. Agerberg, A. Guidolin, I. Ren and M. Scolamiero. Algebraic Wasserstein distances and stable homological invariants of data. (2023) arXiv: 2301.06484.

Sequential biomedical data is ubiquitous, from time-resolved data about patient encounters in the clinical realm to DNA sequences in the biological domain.  The talk will review our latest work in representation learning from longitudinal data, with a particular focus on finding optimal representations for complex and sparse healthcare data. We show how these representations are useful for comparing patient journeys and finding patients with similar health outcomes. We will also venture into the field of genome engineering, where we build models that work on DNA sequences for predicting editing outcomes for base and prime editors. 

I will discuss logarithmic corrections to various CFT partition functions in the context of the AdS4/CFT3 correspondence for theories arising on the worldvolume of M2-branes. I will use four-dimensional gauged supergravity and heat kernel methods and present general expressions for the logarithmic corrections to the gravitational on-shell action or black hole entropy for a number of different supergravity backgrounds. I will outline several subtleties and puzzles in these calculations and contrast them with a similar analysis of logarithmic corrections performed directly in the eleven-dimensional uplift of a given four-dimensional supergravity background. This analysis suggests that four-dimensional supergravity consistent truncations are not the proper setting for studying logarithmic corrections in AdS/CFT. These results have important implications for the existence of scale-separated AdS vacua in string theory and for effective field theory in AdS more generally.

Roughly speaking, class field theory for a number field K describes the abelianization of its absolute Galois group in terms of the idele class group of K. Geometric class field theory is what we get when K is instead the function field of a smooth projective geometrically connected curve X over a finite field. In this talk, I give a precise statement of geometric class field theory in the unramified case and describe how one can prove it by showing the Picard stack of X is the “free dualizable commutative group stack on X”. A key part is to show that the usual “divisor class group exact sequence“ can be done in families to give the adelic uniformization of the Picard stack by the moduli space of Cartier divisors on X. 

I will recall the Zilber-Pink conjecture for Shimura varieties and give my perspective on current progress towards a proof.

In this talk, we investigate distributionally robust optimization (DRO) in a dynamic context. We consider a general penalized DRO problem with a causal transport-type penalization. Such a penalization naturally captures the information flow generated by the models. We derive a tractable dynamic duality formula under a measure theoretic framework. Furthermore, we apply the duality to distributionally robust average value-at-risk and stochastic control problems.

A homogeneous space G/H is called a reductive symmetric space if G is a (real) reductive Lie group, and H is a symmetric subgroup of G, meaning that H is the subgroup fixed by some involution on G. The representation theory on reductive symmetric spaces was studied in depth in the 1990s by Erik van den Ban, Patrick Delorme, and Henrik Schlichtkrull, among many others. In particular, they obtained the Plancherel formula for the L^2 space of G/H. An important aspect is that this generalizes the group case, obtained by Harish-Chandra, which corresponds to the case when G = G' x G' and H is the diagonal subgroup.

In our collaborative efforts with A. Afgoustidis, N. Higson, P. Hochs, Y. Song, we are studying this subject from the perspective of noncommutative geometry. I will describe this exciting new development, with a particular emphasis on describing what is new and how this is different from the traditional group case, i.e. the reduced group C*-algebra of G.

In this talk, we present an algorithm to compute p-adic heights on hyperelliptic curves with good reduction. Our algorithm improves a previous algorithm of Balakrishnan and Besser by being considerably simpler and faster and allowing even degree models. We discuss two applications of our work: to apply the quadratic Chabauty method for rational and integral points on hyperelliptic curves and to test the p-adic Birch and Swinnerton-Dyer conjecture in examples numerically. This is joint work with Steffen Müller.

Richard Hamilton introduced the Ricci flow as a way to study the Poincaré conjecture, which says that every simply connected, compact three-manifold is homeomorphic to the three-sphere. In this talk, we will introduce the Ricci flow in a way that is accessible to anyone with basic knowledge of Riemannian geometry. We will give some examples, discuss finite time singularities, and give an application to a theorem of Hamilton which says that every compact Riemannian 3-manifold with positive Ricci curvature admits a metric of constant positive sectional curvature.

This talk concerns the design and analysis of adaptive FEM-based solution strategies for partial differential equations (PDEs) with uncertain or parameter-dependent inputs. We present two conceptually different strategies: one is projection-based (stochastic Galerkin FEM) and the other is sampling-based (stochastic collocation FEM). These strategies have emerged and become popular as effective alternatives to Monte-Carlo sampling in the context of (forward) uncertainty quantification. Both stochastic Galerkin and stochastic collocation approximations are typically represented as finite (sparse) expansions in terms of a parametric polynomial basis with spatial coefficients residing in finite element spaces. The focus of the talk is on multilevel approaches where different spatial coefficients may reside in different finite element spaces and, therefore, the underlying spatial approximations are allowed to be refined independently from each other.

We start with a more familiar setting of projection-based methods, where exploiting the Galerkin orthogonality property and polynomial approximations in terms of an orthonormal basis facilitates the design and analysis of adaptive algorithms. We discuss a posteriori error estimation as well as the convergence and rate optimality properties of the generated adaptive multilevel Galerkin approximations for PDE problems with affine-parametric coefficients. We then show how these ideas of error estimation and multilevel adaptivity can be applied in a non-Galerkin setting of stochastic collocation FEM, in particular, for PDE problems with non-affine parameterization of random inputs and for problems with parameter-dependent local spatial features.

The talk is based on a series of joint papers with Dirk Praetorius (TU Vienna), Leonardo Rocchi (Birmingham), Michele Ruggeri (University of Strathclyde, Glasgow), David Silvester (Manchester), and Feng Xu (Manchester).

In the 1960s, Lynden-Bell, studying the dynamics of galaxies around steady states of the gravitational Vlasov-Poisson equation, described a phenomenon he called "violent relaxation," a convergence to equilibrium through phase mixing analogous in some respects to Landau damping in plasma physics. In this talk, I will discuss recent work on this gravitational Landau damping for the linearised Vlasov-Poisson equation and, in particular, the critical role of regularity of the steady states in distinguishing damping from oscillatory behaviour in the perturbations. This is based on joint work with Mahir Hadzic, Gerhard Rein, and Christopher Straub.