Wed, 24 Jan 2024
15:30

.

(Oxford University)
Wed, 30 Apr 2025
15:30
C1

Uniqueness of gauge covariant renormalisation of stochastic 3D Yang-Mills

Ilya Chevyrev
(University of Edinburgh)
Abstract

In this talk, I will describe a family of observables for 3D quantum Yang-Mills theory based on regularising connections with the YM heat flow. I will describe how these observables can be used to show that there is a unique renormalisation of the stochastic quantisation equation of YM in 3D that preserves gauge symmetries. This complements a recent result on the existence of such a renormalisation. Based on joint work with Hao Shen.

Tue, 27 May 2025

10:30 - 17:30
L3

One-Day Meeting in Combinatorics

Multiple
Further Information

The speakers are Yuval Wigderson (ETH Zurich), Liana Yepremyan (Emory), Dan Kráľ (Leipzig University and MPI-MiS), Marthe Bonamy (Bordeaux), and Agelos Georgakopoulos (Warwick). Please see the event website for further details including titles, abstracts, and timings. Anyone interested is welcome to attend, and no registration is required.

Tue, 17 Jun 2025

14:00 - 15:00
L4

TBA

Imre Leader
(University of Cambridge)
Tue, 13 May 2025

14:00 - 15:00
L4

TBA

James Davies
(University of Cambridge)
Tue, 06 May 2025

14:00 - 15:00
L4

Optimally packing Hamilton cycles in random directed digraphs

Adva Mond
(King's College London)
Abstract

At most how many edge-disjoint Hamilton cycles does a given directed graph contain? It is easy to see that one cannot pack more than the minimum in-degree or the minimum out-degree of the digraph. We show that in the random directed graph $D(n,p)$ one can pack precisely this many edge-disjoint Hamilton cycles, with high probability, given that $p$ is at least the Hamiltonicity threshold, up to a polylog factor.

Based on a joint work with Asaf Ferber.

Tue, 29 Apr 2025

14:00 - 15:00
L4

Surprising orderings

Jaroslav Nešetřil
(Charles University)
Abstract

Graphs (and structures) which have a linear ordering of their vertices with given local properties have a rich spectrum of complexities. Some have full power of class NP (and thus no dichotomy) but for biconnected patterns we get dichotomy. This also displays the importance of Sparse Incomparability Lemma. This is a joint work with Gabor Kun (Budapest).

Subscribe to