13:00
Categorical fragmentation and filtered topology
Abstract
I will review notions of categorical complexity, and the more recent work of Biran, Cornea and Zhang on fragmentation in triangulated persistence categories (TPCs), then go on to discuss applications of this to filtered topology. In particular, we will consider a suitable category of filtered topological spaces and detail some constructions and properties, before showing that an associated 'filtered stable homotopy category' is a TPC. I will then give some interesting results relating to this.
Mean-field limits of non-exchangeable interacting diffusions on co-evolutionary networks
Abstract
Differentiation on metric spaces
Abstract
2d Sinh-Gordon model on the infinite cylinder
Abstract
The 2d (massless) Sinh-Gordon model is amongst the simplest 2d quantum field theories that are expected to be integrable (= infinitely many symmetries), but without conformal symmetry. In this talk I will explain a rigorous construction of this model and its vertex correlations (= Laplace transforms) on the infinite cylinder using probability theory. A fundamental role is played by the Sinh-Gordon Hamiltonian and I will explain how the theory of Gaussian multiplicative chaos can be used to analyze this linear map. This talk will be based on joint work with Colin Guillarmou and Vincent Vargas.
11:00
Coming up from $-\infty$ for KPZ via stochastic control
Abstract
We derive a lower bound, independent of the initial condition, for the solution of the KPZ equation on the torus, using its representation as the value function of a stochastic control problem.
With the same techniques we also prove a bound for its oscillation, again independent of initial conditions, which is related to Harnack's inequality for the (rough) heat equation.
11:00
What future for mathematics?
Abstract
In this talk, we will explore the emerging role of generative AI in mathematical research. Building on insights from the “Malliavin–Stein experiment”, carried out in collaboration with Charles-Philippe Diez and Luis Da Maia, we will discuss our experience and reflect on how AI might influence the way mathematics is conceived, proven, and created.
11:30
On the weak coupling limit of the Schrödinger equation with periodic potential
13:45
Lean tutorial (part 2)
Abstract
This tutorial will be a hands-on introduction to proving theorems in Lean, using its mathematical library Mathlib. It will not assume any previous knowledge about formal theorem provers. We will discover the Lean language, learn how to read a statement and a proof, and learn the essential "tactics" one can use to prove theorems in Lean.
Participants should come with a computer, and it would be best if they could install Lean before the tutorial by following the instructions at https://lean-lang.org/install/ . The installation should be easy and takes only a few minutes.