C5

One of the main themes in geometric group theory is Gromov's program to classify finitely generated groups up to quasi-isometry. We show that under certain situations, a quasi-isometry preserves commensurator subgroups. We will focus on the case where a finitely generated group G contains a coarse PD_n subgroup H such that G=Comm(H). Such groups can be thought of as coarse fibrations whose fibres are cosets of H; quasi-isometries of G coarsely preserve these fibres. This  generalises work of Whyte and Mosher--Sageev--Whyte.

In the 80s, Hatcher and Thurston introduced the pants graph as a tool to prove that the mapping class group of a closed, orientable surface is finitely presented. The pants graph remains relevant for the study of the mapping class group, sitting between the marking graph and the curve graph. More precisely, there is a sequence of natural coarse lipschitz maps taking the marking graph via the pants graph to the curve graph.

A second motivation for studying the pants graph comes from Teichmüller theory. Brock showed that the pants graph can be interpreted as a combinatorial model for Teichmüller space with the Weil-Petersson metric.

In this talk I will introduce the pants graph, discuss some of its properties and state a few open questions.

Calcination describes the heat treatment of anthracite particles in a furnace to produce a partially-graphitised material which is suitable for use in electrodes and for other met- allurgical applications. Electric current is passed through a bed of anthracite particles, here referred to as a coke bed, causing Ohmic heating and high temperatures which result in the chemical and structural transformation of the material.

Understanding the behaviour of such mechanisms on the scale of a single particle is often dealt with through the use of computational models such as DEM (Discrete Element Methods). However, because of the great discrepancy between the length scale of the particles and the length scale of the furnace, we can exploit asymptotic homogenisation theory to simplify the problem.  

In this talk, we will present some results relating to the electrical and thermal conduction through granular material which define effective quantities for the conductivities by considering a microscopic representative volume within the material. The effective quantities are then used as parameters in the homogenised macroscopic model to describe calcination of anthracite. 

Elements of a finitely generated group have a natural notion of length: namely the length of a shortest word over the generators that represents the element. This allows us to study the growth of such groups by considering the size of spheres with increasing radii. One current area of interest is the rationality or otherwise of the formal power series whose coefficients are the sphere sizes. I will describe a combinatorial way to study this series for the class of virtually abelian groups, introduced by Benson in the 1980s, and then outline its applications to other types of growth series.

Thompson's group F is a group of homeomorphisms of the unit interval which exhibits a strange mix of properties; on the one hand it has some self-similarity type properties one might expect of a really big group, but on the other hand it is finitely presented. I will give a proof of finite generation by expressing elements as pairs of binary trees.

It is known that in steady-state potential flows, the separation of a gravity-driven free-surface from a solid exhibits a number of peculiar characteristics. For example, it can be shown that the fluid must separate from the body so as to form one of three possible in-fluid angles: (i) 180°, (ii) 120°, or (iii) an angle such that the surface is locally perpendicular to the direction of gravity. These necessary separation conditions were notably remarked by Dagan & Tulin (1972) in the context of ship hydrodynamics [J. Fluid Mech., 51(3) pp. 520-543], but they are of crucial importance in many potential flow applications. It is not particularly well understood why there is such a drastic change in the local separation behaviours when the global flow is altered. The question that motivates this work is the following: outside a formal balance-of-terms arguments, why must (i) through (iii) occur and furthermore, what is the connections between them?

              In this work, we seek to explain the transitions between the three cases in terms of the singularity structure of the associated solutions once they are extended into the complex plane. A numerical scheme is presented for the analytic continuation of a vertical jet (or alternatively a rising bubble). It will be shown that the transition between the three cases can be predicted by observing the coalescence of singularities as the speed of the jet is modified. A scaling law is derived for the coalescence rate of singularities.

When dealing with geometric structures one natural question that arise is "when does a subset inherit the geometry of the ambient space"? In the case of hyperbolic space, the concept of quasi-convexity provides answer to this question. However, for a general metric space, being quasi-convex is not a quasi-isometric invariant. This motivates the notion of Morse subsets. In this talk we will motivate the definition and introduce some examples. Then we will introduce the class of hierarchically hyperbolic groups (HHG), and furnish a complete characterization of Morse subgroups of HHG. If time allows, we will discuss the relationship between Morse subgroups and hyperbolically-embedded subgroups. This is a joint work with Hung C. Tran and Jacob Russell.

tba

In 2012 Eskin, Fisher and Whyte proved there was a locally finite vertex transitive graph which was not quasi-isometric to any connected locally finite Cayley Graph. This motivates the study of vertex transitive graphs from a geometric group theory point of view. We will discus how concepts and problems from group theory generalise to this setting. Constructing one framework in which problems can be framed so that techniques from group theory can be applied. This is work in progress with Agelos Georgakopoulos.

Over the past decade, the randomized singular value decomposition (RSVD)
algorithm has proven to be an efficient, reliable alternative to classical
algorithms for computing low-rank approximations in a number of applications.
However, in cases where no information is available on the singular value
decay of the data matrix or the data matrix is known to be close to full-rank,
the RSVD is ineffective. In recent years, there has been great interest in
randomized algorithms for computing full factorizations that excel in this
regime.  In this talk, we will give a brief overview of some key ideas in
randomized numerical linear algebra and introduce a new randomized algorithm for
computing a full, rank-revealing URV factorization.