Solving sparse linear systems is omnipresent in scientific computing. Direct approaches based on matrix factorization are very robust, and since they can be used as a black-box, it is easy for other software to use them. However, the memory requirement of direct approaches scales poorly with the problem size, and the algorithms underpinning sparse direct solvers software are poorly suited to parallel computation. Multilevel Domain decomposition (MDD) methods are among the most efficient iterative methods for solving sparse linear systems. One of the main technical difficulties in using efficient MDD methods (and most other efficient preconditioners) is that they require information from the underlying problem which prohibits them from being used as a black-box. This was the motivation to develop the widely used algebraic multigrid for example. I will present a series of recently developed robust and fully algebraic MDD methods, i.e., that can be constructed given only the coefficient matrix and guarantee a priori prescribed convergence rate. The series consists of preconditioners for sparse least-squares problems, sparse SPD matrices, general sparse matrices, and saddle-point systems. Numerical experiments illustrate the effectiveness, wide applicability, scalability of the proposed preconditioners. A comparison of each one against state-of-the-art preconditioners is also presented.

I discuss the set of rates of growth of a finitely generated 
group with respect to all its finite generating sets. In a joint work 
with Sela, for a hyperbolic group, we showed that the set is 
well-ordered, and that each number can be the rate of growth of at most 
finitely many generating sets up to automorphism of the group. I may 
discuss its generalization to acylindrically hyperbolic groups.

We will describe a new equivariant version of discrete Morse theory designed specially for quotient objects X/G which arise naturally in geometric group theory from actions of finite groups G on finite simplicial complexes X. Our main tools are (A) a reconstruction theorem due to Bridson and Haefliger which recovers X from X/G decorated with stabiliser data, and (B) a 2-categorical upgrade of discrete Morse theory which faithfully captures the underlying homotopy type. Both tools will be introduced during the course of the talk. This is joint work with Naya Yerolemou.

This is joint work with Corey Bregman. We study the homotopy type of embedding spaces of unparameterised links, inspired by work of Brendle and Hatcher. We obtain a simple description of the fundamental group of the embedding space, which I will describe for you. Our main tool is a homotopy equivalent semi-simplicial space of separating spheres. As I will explain, this is a combinatorial object that provides a gateway to studying the homotopy type of embedding spaces of split links via the homotopy type of their individual pieces. 

Since their introduction by Gromov in the 80s, a wealth of tools have been developed to study hyperbolic groups. Thus, when studying a class of groups, a characterisation of those that are hyperbolic can be very useful. In this talk, we will turn to the class of one-relator groups. In previous work, we showed that a one-relator group not containing any Baumslag--Solitar subgroups is hyperbolic, provided it has a Magnus hierarchy in which no one-relator group with a so called `exceptional intersection' appears. I will define one-relator groups with exceptional intersection, discuss the aforementioned result and will then provide a characterisation of the hyperbolic one-relator groups with exceptional intersection. Finally, I will then discuss how this characterisation can be used to establish properties for all one-relator groups.