University of Oxford

For the first time, a method has become available for fast computation of near-best rational approximations on arbitrary sets in the real line or complex plane: the AAA algorithm (Nakatsukasa-Sète-T. 2018).  After a brief presentation of the algorithm this talk will focus on sixteen demonstrations of the kinds of things we can do, all across applied mathematics, with a black-box rational approximation tool.
 

I will outline a new algorithm for unknot recognition that runs in quasi-polynomial time. The input is a diagram of a knot with n crossings, and the running time is n^{O(log n)}. The algorithm uses hierarchies, normal surfaces and Heegaard splittings.

Studying quasi-isometries between groups is a major theme in geometric group theory. Of particular interest are the situations where the existence of a quasi-isometry between two groups implies that the groups are equivalent in a stronger algebraic sense, such as being commensurable. I will survey some results of this type, and then talk about recent work with Daniel Woodhouse where we prove quasi-isometric rigidity for certain graphs of virtually free groups, which include "generic" cyclic HNN extensions of free groups.

Hierarchically Hyperbolic Groups (HHGs) were introduced by Behrstock—Hagen—Sisto to provide a common framework to study several groups of interest in geometric group theory, and have been an object of great interest in the area ever since. The goal of the talk is to provide an introduction to the theory of HHGs and discuss the advantages of the unified approach that they provide. If time permits, we will conclude with applications to growth and asymptotic cones of groups.

I will introduce the Friedl-Tillmann polytope for one-relator groups, and then discuss how it can be generalised to the Friedl-Lück polytope, how it connects to the Thurston polytope, and how we can view it as a convenient source of intuition and ideas.

In joint work with Jacob Tsimerman we study when the primitive
of a given algebraic function can be constructed using primitives
from some given finite set of algebraic functions, their inverses,
algebraic functions, and composition. When the given finite set is just {1/x}
this is the classical problem of "elementary integrability".
We establish some results, including a decision procedure for this problem.

We can learn a lot about an integral domain by studying the Galois group of its fraction field. These groups are generally quite complicated and hard to understand, but their representations, so-called Galois representations, contain more easily accessible information. These also play the lead in many important theorems and conjectures of modern maths, such as the Modularity theorem and the Langlands programme. In this talk we give a quick introduction to Galois representations, motivated by lots of examples aimed at a general algebraist audience, and talk about some open problems.

A branched covering between two surfaces looks like a regular covering map except for finitely many branching points, where some non-trivial ramification may occur. Informally speaking, the existence problem asks whether we can find a branched covering with prescribed behaviour around its branching points.

A variety of techniques have historically been employed to tackle this problem, ranging from studying representations of surface groups into symmetric groups to drawing "dessins d'enfant" on the covering surface. After introducing these techniques and explaining how they can be applied to the existence problem, I will briefly present a conjecture unexpectedly relating branched coverings and prime numbers.
 

We will give a fairly self contained introduction to acylindrically hyperbolic groups, using mapping class groups as a motivating example. This will be a mainly expository talk, the aim is to make my topology seminar talk in week 5 more accessible to people who are less familiar with these topics.