Congratulations to Oxford Mathematician Ehud Hrushovski who has been elected Fellow of the Royal Society (FRS).
15:00
Boundary regularity of area-minimizing currents: a linear model with analytic interface
Abstract
Given a curve , what is the surface that has smallest area among all surfaces spanning ? This classical problem and its generalizations are called Plateau's problem. In this talk we consider area minimizers among the class of integral currents, or roughly speaking, orientable manifolds. Since the 1960s a lot of work has been done by De Giorgi, Almgren, et al to study the interior regularity of these minimizers. Much less is known about the boundary regularity, in the case of codimension greater than 1. I will speak about some recent progress in this direction.
Approximating Traces: What, Why and How
UK virtual operator algebras seminar by zoom: https://sites.google.com/view/uk-operator-algebras-seminar/home
Extensions of C*-algebras
UK Virtual operator algebras seminar by zoom: https://sites.google.com/view/uk-operator-algebras-seminar/home
Abstract
Having its roots in classical operator theoretic questions, the theory of extensions of C*-algebras is now a powerful tool with applications in geometry and topology and of course within the theory of C*-algebras itself. In this talk I will give a gentle introduction to the topic highlighting some classical results and more recent applications and questions.
Amenability via ultraproduct embeddings for II_1 factors
UK Virtual operator algebras seminar by zoom. https://sites.google.com/view/uk-operator-algebras-seminar/home
Abstract
The property of amenability is a cornerstone in the study and classification of II_1 factor von Neumann algebras. Likewise, ultraproduct analysis is an essential tool in the subject. We will discuss the history, recent results, and open questions on characterizations of amenability for separable II_1 factors in terms of embeddings into ultraproducts.
10:00
Poincare's Polyhedron Theorem and Applications to Algorithms.
Abstract
Much progress in the study of 3-manifolds has been made by considering the geometric structures they admit. This is nowhere more true than for 3-manifolds which admit a hyperbolic structure. However, in the land of algorithms a more combinatorial approach is necessary, replacing our charts and isometries with finite simplicial complexes that are defined by a finite amount of data.
In this talk we'll have a look at how in fact one can combine the two approaches, using the geometry of hyperbolic 3-manifolds to assist in this more combinatorial approach. To do so we'll combine tools from Hyperbolic Geometry, Triangulations, and perhaps suprisingly Polynomial Algebra to find explicit bounds on the runtime of an algorithm for comparing Hyperbolic manifolds.
10:00
A Mapping Class Group Presentation from Fatgraphs
Abstract
The mapping class group of a surface with boundary acts freely and properly discontinuously on the fatgraph complex, which is a contractible cell complex arising from a cell decomposition of Teichmuller space. We will use this action to get a presentation of the mapping class group in terms of fat graphs, and convert this into one in terms of chord diagrams. This chord slide presentation has potential applications to computing bordered Heegaard Floer invariants for open books with disconnected binding.
10:00
Revisiting Leighton's Theorem
Abstract
Let X_1 and X_2 be finite graphs with isomorphic universal covers.
Leighton's graph covering theorem states that X_1 and X_2 have a common finite cover.
I will discuss recent work generalizing this theorem and how myself and Sam Shepherd have been applying it to rigidity questions in geometric group theory.
12:45
Superstrings, Calabi-Yau Manifolds and Machine-Learning -- ZOOM SEMINAR
Abstract
We review how historically the problem of string phenomenology lead theoretical physics first to algebraic/diffenretial geometry, and then to computational geometry, and now to data science and AI.
With the concrete playground of the Calabi-Yau landscape, accumulated by the collaboration of physicists, mathematicians and computer scientists over the last 4 decades, we show how the latest techniques in machine-learning can help explore problems of physical and mathematical interest.
An Equilibrium Model of the Limit Order Book: a Mean-field Game approach
Abstract
We study a continuous time equilibrium model of limit order book (LOB) in which the liquidity dynamics follows a non-local, reflected mean-field stochastic differential equation (SDE) with evolving intensity. We will see that the frontier of the LOB (e.g., the best ask price) is the value function of a mean-field stochastic control problem, as the limiting version of a Bertrand-type competition among the liquidity providers.
With a detailed analysis on the N-seller static Bertrand game, we formulate a continuous time limiting mean-field control problem of the representative seller.
We then validate the dynamic programming principle (DPP) and show that the value function is a viscosity solution of the corresponding Hamilton-Jacobi-Bellman (HJB) equation.
We argue that the value function can be used to obtain the equilibrium density function of the LOB. (Joint work with Jin Ma)