Wed, 17 Jun 2026

16:00 - 17:00
L6

The Kervaire conjecture for torsion-free groups

Alba Gonzalez Gonzalez
(Mathematical Institute University of Oxford)
Abstract

The Kervaire conjecture was formulated around 1963 after a conversation between Kervaire and Baumslag. It states that adding a generator and then a relator to a non-trivial group always yields a non-trivial group. To this day, the conjecture remains unproven in its most general form; however, it has been shown under certain additional hypotheses, either on the new relator or on the original group. For instance, the result holds for locally indicable groups and for locally residually finite groups. In this talk, I will explain Klyachko’s proof of the conjecture for torsion-free groups, which uses a funny property of the sphere known as the Car Crash Theorem, and van Kampen pictures. I will also discuss how these techniques were generalised by Fenn and Rourke to study equations over torsion-free groups defined by a large class of words (amenable words).

Wed, 10 Jun 2026

16:00 - 17:00
L5

The fiber of multiparameter persistent homology for simplicial complexes

Maria Torras Perez
(Mathematical Institute University of Oxford)
Abstract
Persistent homology is a powerful descriptor of filtered spaces, but it is generally not injective: many filtrations can have the same persistent homology. In this talk, I will introduce multiparameter persistent homology (MPH) and the associated inverse problem for sublevel-set filtrations on a fixed finite simplicial complex. I will then describe recent work in which we study this map by decomposing both its domain, the space of filters, and its codomain, a moduli space of essentially finite persistence modules, into simpler pieces, allowing us to view MPH as a stratified map. Using this structure, we show that the fibers of the MPH map are polyhedral complexes and bound their dimension in terms of multigraded Betti numbers, recovering the known one-parameter bound as a special case.


 

Wed, 20 May 2026

16:00 - 17:00
L5

Ends of Diabolical Groups

Andrew Wood
(Mathematical Institute University of Oxford)
Abstract

In 1982, Conway introduced the angel-devil game, which is played on an infinite chess board.  For fixed k, the angel moves at most distance k from its current position on its turn.  The devil then blocks a square permanently.  The devil wins if the angel eventually has no legal moves left.  Berlekamp showed the devil wins against the 1-angel.  Conway asked whether there exists k such that the k-angel has a winning strategy against the devil.  This was resolved independently by Kloster, Máthé, and Bowditch in 2006.  Bowditch proposed playing the game on Cayley graphs of finitely generated groups.  A group for which the devil beats the k-angel for every k is called diabolical.  We will explore the ends of these diabolical groups.

Wed, 06 May 2026

16:00 - 17:00
L6

Algorithmic characterizations of hyperbolicity via quasigeodesics

Arya Saranathan
(Mathematical Institute University of Oxford)
Abstract

Gromov-hyperbolic groups are classically defined geometrically, by the negative curvature of their Cayley graphs. Interestingly, an algorithmic characterization of hyperbolicity is possible in terms of properties of the formal languages of quasigeodesics (geodesics up to bounded error) in their Cayley graphs. Holt and Rees proved, roughly speaking, that these formal languages are regular in the case of hyperbolic groups. More recently Hughes, Nairne, and Spriano established the converse. In this talk, I will discuss progress towards a conjectured strengthening of the result, where we consider context-free quasigeodesic languages. This is based on my summer project, supervised by Joseph MacManus and Davide Sprianoc

Wed, 03 Jun 2026

16:00 - 17:00
L6

Archimedean Closure and Property FD

Gargi Biswas
(Mathematical Institute University of Oxford)
Abstract

In this talk, I will introduce the concept of Archimedean closedness - a concept from real non-commutative algebraic geometry which determines when "positivity" of an element (captured through *-representations) in a *-algebra can be completely certified algebraically. On the other hand, property FD is a representation theoretic property of groups depicting when any representation of a group can be approximated by finite representations in the unitary dual. I will try to connect these two seemingly very different concepts through some examples and speculations. This is a work in progress.

Wed, 29 Apr 2026

16:00 - 17:00
L5

Computations of Floer Lasagna Modules

Colin McCulloch
(Mathematical Institute University of Oxford)
Abstract

Skein lasanga modules are a smooth 4-manifold invariant that was introduced by Morrison, Walker and Wedrich using Khovanov homology. This invariant was recently used by Ren and Willis to give the first analysis free proof of the existence of exotic 4-manifolds. However, even for simple handlebodies it remains difficult to compute. A generalisation was introduced by Chen using Knot Floer homology, which in principle should be easier to compute due to cabling formulas for knot Floer homology. I will give a general introduction to lasagna modules assuming no knowledge of Khovanov or knot Floer homology, and then explain some methods, from upcoming work, for computing Floer Lasagna modules.

Wed, 28 Jan 2026

11:00 - 13:00
L4

Renormalization of the subcritical sine-Gordon model

Jaka Pelaic
(Mathematical Institute University of Oxford)
Abstract

We give an introduction to a rigorous renormalization group analysis of the sine-Gordon model with a focus on deriving the lowest-order beta function.

Wed, 22 Oct 2025

16:00 - 17:00
L6

Introduction to group cohomology and a fixed point theorem

Shaked Bader
(Mathematical Institute University of Oxford)
Abstract
Most of the talk would be devoted to basic definitions and cute facts that are easy to prove with group cohomology. In the second part I'll state and prove a recent fixed point theorem which is joint work with Saar Bader, Uri Bader and Roman Sauer. Both parts of the talk should be followable to anyone who knows undergraduate level Algebraic Topology.


 

Mon, 01 Dec 2025

16:30 - 17:30
L4

Exponential and algebraic decay in  Euler--alignment system with nonlocal interaction forces

Dowan Koo
(Mathematical Institute University of Oxford)
Abstract
In this talk, I will introduce the hydrodynamic Euler–Alignment model, focusing on the pressureless case coupled with nonlocal interaction forces, and discuss its large-time dynamics—namely, the emergence of flocking and the characterization of its asymptotic behavior.
New flocking estimates will be presented, showing how the confining effect of nonlocal interaction can, in certain regimes, replace the role of velocity alignment.
The quantitative analysis of the asymptotic behavior will also be discussed. Overall, the convergence rate depends only on the local behavior of the communication weight: bounded kernels lead to exponential decay, while weakly singular ones yield algebraic rates. This reveals a sharp transition in decay rates driven solely by the local singularity of the communication kernel, a regime that had remained largely unexplored.
This talk is based on joint work with José Carrillo (University of Oxford), Young-Pil Choi (Yonsei University), and Oliver Tse (Eindhoven University of Technology).
Tue, 25 Nov 2025
14:00
C4

From Hostility to Hyperlinks: Mining Social Networks with Heterogenous Ties --- Dynamics and Organisation in Complex Systems: From Cytokines to Cities

Shazia'Ayn Babul & Sofia Medina
(Mathematical Institute University of Oxford)
Abstract
From Hostility to Hyperlinks: Mining Social Networks with Heterogenous Ties
Social networks are a fundamental tool for understanding emergent behaviour in human society, providing a mathematical framework that emphasizes the importance of interactions between the individuals in the network.  While traditional social network models consider all social ties as uniform, either an edge exists or it does not, human nature is more complex and individuals can be linked by relationships that differ in nature, intensity, or sentiment. This tie-level complexity can be represented using more complex network models, including signed, weighted and multiplex networks, where edge-level attributes delineate between the types of interactions.  A growing body of literature is devoted to developing methods for extracting information from such heterogeneous networks, from probing the latent structure to investigating dynamical processes occurring overtop of them.  Here, we focus on ties that vary in sentiment, using signed networks in which edges carry positive or negative weights,  representing  cooperative or antagonistic relationships, and ties that vary in nature, using weighted and multiplex network models. We present models and empirical studies that adapt traditional network science methods to extract information, detect multi-scale structure and characterize dynamical processes, to the heterogeneous network context. Overall, this thesis presents methodological and empirical advances, which demonstrate the advantage of maintaining tie-level complexity in mining social networks.
 
Dynamics and Organisation in Complex Systems: From Cytokines to Cities
Complex systems, with their intricate web of interacting components, are ubiquitous across diverse domains. We employ models and develop novel methodologies to study such systems in a variety of applications. This work is organized into three parts, each addressing systems at progressively larger scales. In the first part, we examine a network of immune system signalling molecules extracted from in vitro gut biopsy data and assess the dynamical influence of individual components on each other. In the second part, we analyse trends in mobile phone application traffic following major events. We detect spatiotemporal changes in application traffic and characterise trends in application usage. Finall, in the third part, we develop a novel methodology to analyse connectivity and reachability in systems modelled by directed hypergraphs, in order to account for multi-body interactions. Building on this, we apply the method to chemical reaction data, unveiling the structure of the data and giving insights into chemical organisation. Taken together, this thesis contributes new methods for the study of complex systems, revealing structural patterns and their effects within datasets, and introducing methodological tools and system-level insights to support further investigation.
 
Subscribe to Mathematical Institute University of Oxford