Wed, 10 Nov 2021

14:00 - 15:00
Virtual

3d N=4 theories on an elliptic curve

Daniel Zhang
(Cambridge DAMTP)
Abstract

I will discuss 3d N=4 supersymmetric gauge theories compactified on an elliptic curve, and how this set-up physically realises recent mathematical results on the equivariant elliptic cohomology of symplectic resolutions. In particular, I will describe the Berry connection for supersymmetric ground states, and in doing so connect the elliptic cohomology of the Higgs branch with spectral data of doubly periodic monopoles. I will show that boundary conditions, via a consideration of boundary ’t Hooft anomalies, naturally represent elliptic cohomology classes. Finally, if I have time, I will discuss mirror symmetry/symplectic duality in our framework, and physically recover concepts in elliptic cohomology such as the mother function, and the elliptic stable envelopes of Aganagic-Okounkov.


This talk will be based on https://arxiv.org/abs/2109.10907 with Mathew Bullimore.

Wed, 26 Jan 2022

16:00 - 17:00
C2

Moduli space approach to the conjectures of Ivanov and Putman-Wieland

Ognjen Tosic
(University of Oxford)
Abstract

A well-known conjecture of Ivanov states that mapping class groups of surfaces with genus at least 3 virtually do not surject onto the integers. Putman and Wieland reformulated this conjecture in terms of higher Prym representations of finite-index subgroups of mapping class groups. We show that the Putman-Wieland conjecture holds for geometrically uniform subgroups. Along the way we construct a cover S of the genus 2 surface such that the lifts of simple closed curves do not generate the rational homology of S. This is joint work with Markovic.

Wed, 01 Dec 2021

16:00 - 17:00
C5

Group theoretic hyperbolicity and Dehn filling

Bin Sun
(University of Oxford)
Abstract

Group theoretic Dehn filling, motivated by Dehn filling in the theory of 3- manifolds, is a process of constructing quotients of a given group. This technique is usually applied to groups with certain negative curvature feature, for example word-hyperbolic groups, to construct exotic and useful examples of groups. In this talk, I will start by recalling the notion of word-hyperbolic groups, and then show that how group theoretic Dehn filling can be used to answer the Burnside Problem and questions about mapping class groups of surfaces.

Wed, 24 Nov 2021

16:00 - 17:00
C5

Embedding subgroups into big mapping class groups

Davide Spriano
(University of Oxford)
Abstract

A big mapping class group is the mapping class group (MCG) of a surface of infinite type. Although several aspects of big MCGs remain mysterious, their geometric definition allows some simple, interesting arguments. In this talk, we will use big MCGs as an excuse to survey some (more or less) classical results in geometric group theory: we will present a quick introduction to infinite type surfaces, highlight differences between standard and large MCGs, and use Higman’s embedding theorem to deduce that there exists a big MCG that contains every finitely presented group as a subgroup.

Tue, 23 Nov 2021

14:00 - 15:00
Virtual

Signal processing on graphs and complexes

Michael Schaub
(RWTH Aachen University)
Abstract

We are confronted with signals defined on the nodes of a graph in many applications.  Think for instance of a sensor network measuring temperature; or a social network, in which each person (node) has an opinion about a specific issue.  Graph signal processing (GSP) tries to device appropriate tools to process such data by generalizing classical methods from signal processing of time-series and images -- such as smoothing, filtering and interpolation -- to signals defined on graphs.  Typically, this involves leveraging the structure of the graph as encoded in the spectral properties of the graph Laplacian.

In other applications such as traffic network analysis, however, the signals of interest are naturally defined on the edges of a graph, rather than on the nodes. After a very brief recap of the central ideas of GSP, we examine why the standard tools from GSP may not be suitable for the analysis of such edge signals.  More specifically, we discuss how the underlying notion of a 'smooth signal' inherited from (the typically considered variants of) the graph Laplacian are not suitable when dealing with edge signals that encode flows.  To overcome this limitation we devise signal processing tools based on the Hodge-Laplacian and the associated discrete Hodge Theory for simplicial (and cellular) complexes.  We discuss applications of these ideas for signal smoothing, semi-supervised and active learning for edge-flows on discrete (or discretized) spaces.

Tue, 16 Nov 2021

14:00 - 15:00
C5

TBA

George Cantwell
(Santa Fe Institute)
Abstract

TBA

Mon, 29 Nov 2021
12:45
L5

Scattering amplitudes and tropical Grassmannians

Omer Gurdogan
(University of Southampton)
Abstract

The analytic structure of scattering amplitudes exhibit striking
properties that are not at all evident from the first principles of
Quantum Field Theory. These are often rich and powerful enough to be
considered as their defining features, and this makes the problem of
finding a set of universal rules a compelling one. I will review the
recently mounting evidence for the relevance of tropical Grassmannians
in this respect, including implications on symbol alphabets and
adjacency conditions

So, the first term at university. And, more specifically, the first mathematical term at Oxford. What's in store? Well, our students' mathematical experience in their first term (and beyond) comprises two parts: lectures and tutorials. How do they work?

Wed, 03 Nov 2021

14:00 - 15:00
Virtual

Scattering Amplitudes and Cluster Algebras

Anders Schreiber
Abstract

In this talk we will study scattering amplitudes N=4 super-Yang-Mills theory. In this theory, scattering amplitudes are known to be functions of cluster variables of Gr(4,n) and certain algebraic functions of cluster variables. We will give an overview of how this cluster algebraic structure manifests, and will exploit it in an algorithm for computing symbol alphabets by solving matrix equations of the form C.Z = 0 associated with plabic graphs. These matrix equations associate functions on Gr(m,n) to parameterizations of certain cells of Gr_+ (k,n) indexed by plabic graphs. We are able to reproduce all known algebraic functions of cluster variables appearing in known symbol alphabets. We further show that it is possible to obtain all rational symbol letters (in fact all cluster variables) by solving C.Z = 0 if one allows C to be an arbitrary cluster parameterization of the top cell of Gr_+ (n-4,n).

Tue, 16 Nov 2021
14:00
L6

The singularity probability of a random symmetric matrix is exponentially small

Matthew Jenssen
Abstract

Let $A$ be drawn uniformly at random from the set of all $n \times n$ symmetric matrices with entries in $\{-1,1\}$. We show that $A$ is singular with probability at most $e^{-cn}$ for some absolute constant $c>0$, thereby resolving a well-known conjecture. This is joint work with Marcelo Campos, Marcus Michelen and Julian Sahasrabudhe.
 

Subscribe to