13:00
13:00
12:00
Multi-Entropy Measures for Topologically Ordered Phases in (2+1) Dimensions
Abstract
Entanglement entropy has long served as a key diagnostic of topological order in (2+1) dimensions. In particular, the topological entanglement entropy captures a universal quantity (the total quantum dimension) of the underlying topological order. However, this information alone does not uniquely determine which topological order is realized, indicating the need for more refined probes. In this talk, I will present a family of quantities formulated as multi-entropy measures, including examples such as reflected entropy and the modular commutator. Unlike the conventional bipartite setting of topological entanglement entropy, these multi-entropy measures are defined for tripartite partitions of the Hilbert space and capture genuinely multipartite entanglement. I will discuss how these measures encode additional universal data characterizing topologically ordered ground states.
16:00
Sums along binary cubic forms
Abstract
We discuss ongoing work with Joseph Leung in which we obtain estimates for sums of Fourier coefficients of GL(2) and certain GL(3) automorphic forms along the values of irreducible binary cubics.
16:00
Manin's conjecture for Châtelet surfaces
Abstract
We resolve Manin's conjecture for all Châtelet surfaces over Q
(surfaces given by equations of the form x^2 + ay^2 = f(z)) -- in other
words, we establish asymptotics for the number of rational points of
increasing height. The key analytic ingredient is estimating sums of
Fourier coefficients of modular forms along polynomial values.
$k$-blocks and forbidden induced subgraphs
Abstract
A $k$-block in a graph is a set of $k$ vertices every two of which are joined by $k$ vertex disjoint paths. By a result of Weissauer, graphs with no $k$-blocks admit tree-decompositions with especially useful structure. While several constructions show that it is probably very difficult to characterize induced subgraph obstructions for bounded tree width, a lot can be said about graphs with no $k$-blocks. On the other hand, forbidding induced subgraphs places significant restrictions on the structure of a $k$-block in a graphs. We will discuss this phenomenon and its consequences in the study of tree-decompositions in classes of graphs defined by forbidden induced subgraphs.
Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.
13:00
Double scaled SYK and the quantum geometry of 3D de Sitter space
Abstract
In this talk, I describe an exact duality between the double scaling limit of the SYK model and quantum geometry of de Sitter spacetime in three dimensions. The duality maps the so-called chord rules that specify the exact SYK correlations functions to the skein relations that govern the topological interactions between world-line operators in 3D de Sitter gravity.
This talk is part of the series of Willis Lamb Lectures in Theoretical Physics. Herman Verlinde is the Lamb Lecturer of 2024.
Colouring and domination in tournaments
Abstract
"Colouring" a tournament means partitioning its vertex set into acylic subsets; and the "domination number" is the size of the smallest set of vertices with no common in-neighbour. In some ways these are like the corresponding concepts for graphs, but in some ways they are very different. We give a survey of some recent results and open questions on these topics.
Joint with Tung Nguyen and Alex Scott.
A loglog step towards the Erdős-Hajnal conjecture
Abstract
In 1977, Erdős and Hajnal made the conjecture that, for every graph $H$, there exists $c>0$ such that every $H$-free graph $G$ has a clique or stable set of size at least $|G|^c$; and they proved that this is true with $|G|^c$ replaced by $2^{c\sqrt{\log |G|}}$. Until now, there has been no improvement on this result (for general $H$). We recently proved a strengthening: that for every graph $H$, there exists $c>0$ such that every $H$-free graph $G$ with $|G|\ge 2$ has a clique or stable set of size at least $2^{c\sqrt{\log |G| \log\log|G|}}$. This talk will outline the proof. Joint work with Matija Bucić, Tung Nguyen and Alex Scott.
Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.
The link surgery formula and plumbed 3-manifolds
Abstract
Lattice homology is a combinatorial invariant of plumbed 3-manifolds due to Nemethi. The definition is a formalization of Ozsvath and Szabo's computation of the Heegaard Floer homology of plumbed 3-manifolds. Nemethi conjectured that lattice homology is isomorphic to Heegaard Floer homology. For a restricted class of plumbings, this isomorphism is known to hold, due to work of Ozsvath-Szabo, Nemethi, and Ozsvath-Stipsicz-Szabo. By using the Manolescu-Ozsvath link surgery formula for Heegaard Floer homology, we prove the conjectured isomorphism in general. In this talk, we will talk about aspects of the proof, and some related topics and extensions of the result.
The nonlinear stability of Kerr for small angular momentum
Abstract
I will report on my most recent results with Jeremie Szeftel and Elena Giorgi which conclude the proof of the nonlinear, unconditional, stability of slowly rotating Kerr metrics. The main part of the proof, announced last year, was conditional on results concerning boundedness and decay estimates for nonlinear wave equations. I will review the old results and discuss how the conditional results can now be fully established.