Wed, 07 Nov 2018
16:00
C1

Boundaries of Hyperbolic Groups

Sam Colvin
(Bristol University)
Abstract

You’re an amateur investigator hired to uncover the mysterious goings on of a dark cult. They call themselves Geometric Group Theorists and they’re under suspicion of pushing humanity’s knowledge too far. You’ve tracked them down to their supposed headquarters. Foolishly, you enter. Your mind writhes as you gaze unwittingly upon the Eldritch horror they’ve summoned… Group Theory! You think fast; donning the foggy glasses of quasi-isometry, you prevent your mind shattering from the unfathomable complexity of The Beast. You spy a weak spot and the phrase `Gromov Hyperbolicity’ flashes across your mind. You peer deeper, further, forever… only to find yourself somewhere rather familiar, strange, but familiar… no, self-similar! You’ve fought with fractals before, this weirdness can be tamed! Your insight is sufficient and The Beast retreats for now.
In other words, given an infinite group, we associate to it an infinite graph, called a Cayley graph, which gives us a notion of the ‘geometry’ of a group. Through this we can ask what kind of groups have hyperbolic geometry, or at least an approximation of it called Gromov hyperbolicity. Hyperbolic groups are quite a nice class of groups but a large one, so we introduce the Gromov boundary of a hyperbolic group and explain how it can be used to distinguish groups in this class.

Wed, 24 Oct 2018
16:00
C1

Finding fibres for free factors

Benjamin Brück
(Bielefeld University)
Abstract

"Fibre theorems" in the style of Quillen's fibre lemma are versatile tools used to study the topology of partially ordered sets. In this talk, I will formulate two of them and explain how these can be used to determine the homotopy type of the complex of (conjugacy classes of) free factors of a free group.
The latter is joint work with Radhika Gupta (see https://arxiv.org/abs/1810.09380).

Wed, 31 Oct 2018
16:00
C1

An Introduction to Seifert Fibred Spaces

Joseph Scull
(Oxford University)
Abstract


A core problem in the study of manifolds and their topology is that of telling them apart. That is, when can we say whether or not two manifolds are homeomorphic? In two dimensions, the situation is simple, the Classification Theorem for Surfaces allows us to differentiate between any two closed surfaces. In three dimensions, the problem is a lot harder, as the century long search for a proof of the Poincaré Conjecture demonstrates, and is still an active area of study today.
As an early pioneer in the area of 3-manifolds Seifert carved out his own corner of the landscape instead of attempting to tackle the entire problem. By reducing his scope to the subclass of 3-manifolds which are today known as Seifert fibred spaces, Seifert was able to use our knowledge of 2-manifolds and produce a classification theorem of his own.
In this talk I will define Seifert fibred spaces, explain what makes them so much easier to understand than the rest of the pack, and give some insight on why we still care about them today.
 

Tue, 30 Oct 2018

14:00 - 14:30
L5

A crash-course on persistent homology

Vidit Nanda
(Oxford)
Abstract

This talk features a self-contained introduction to persistent homology, which is the main ingredient of topological data analysis. 

Thu, 07 Feb 2019

16:00 - 17:30
L3

Fracture dynamics in foam: Finite-size effects

Dr. Peter Stewart
(University of Glasgow)
Abstract

Injection of a gas into a gas/liquid foam is known to give rise to instability phenomena on a variety of time and length scales. Macroscopically, one observes a propagating gas-filled structure that can display properties of liquid finger propagation as well as of fracture in solids. Using a discrete model, which incorporates the underlying film instability as well as viscous resistance from the moving liquid structures, we describe brittle cleavage phenomena in line with experimental observations. We find that  the dimensions of the foam sample significantly affect the speed of the  cracks as well as the pressure necessary to sustain them: cracks in wider samples travel faster at a given driving stress, but are able to avoid arrest and maintain propagation at a lower pressure (the  velocity gap becomes smaller). The system thus becomes a study case for stress concentration and the transition between discrete and continuum systems in dynamical fracture; taking into account the finite dimensions of the system improves agreement with experiment.

Thu, 29 Nov 2018

16:00 - 17:30
L3

From artificial active matter to BacteriaBots

Dr. Juliane Simmchen
(TU Dresden)
Abstract

Motion at the microscale is a fascinating field visualizing non-equilibrium behaviour of matter. Evolution has optimized the ability of microscale swimming on different length scales from tedpoles, to sperm and bacteria. A constant metabolic energy input is required to achieve active propulsion which means these systems are obeying the laws imposed by a low Reynolds number. Several strategies - including topography1 , chemotaxis or rheotaxis2 - have been used to reliably determine the path of active particles. Curiously, many of these strategies can be recognized as analogues of approaches employed by nature and are found in biological microswimmers.

 

[[{"fid":"53543","view_mode":"media_square","fields":{"format":"media_square","field_file_image_alt_text[und][0][value]":false,"field_file_image_title_text[und][0][value]":false},"type":"media","field_deltas":{"1":{"format":"media_square","field_file_image_alt_text[und][0][value]":false,"field_file_image_title_text[und][0][value]":false}},"attributes":{"class":"media-element file-media-square","data-delta":"1"}}]]

Bacteria attached to the metal caps of Janus particles3

However, natural microswimmers are not limited to being exemplary systems on the way to artificial micromotion. They certainly enable us to observe how nature overcame problems such as a lack of inertia, but natural microswimmers also offer the possibility to couple them to artificial microobjects to create biohybrid systems. Our group currently explores different coupling strategies and to create so called ‘BacteriaBots’.4

1 J. Simmchen, J. Katuri, W. E. Uspal, M. N. Popescu, M. Tasinkevych, and S. Sánchez, Nat. Commun., 2016, 7, 10598.

2 J. Katuri, W. E. Uspal, J. Simmchen, A. Miguel-López and S. Sánchez, Sci. Adv., , DOI:10.1126/sciadv.aao1755.

3 M. M. Stanton, J. Simmchen, X. Ma, A. Miguel-Lopez, S. Sánchez, Adv. Mater. Interfaces, DOI:10.1002/admi.201500505.

4 J. Bastos-Arrieta, A. Revilla-Guarinos, W. E. Uspal and J. Simmchen, Front. Robot. AI, 2018, 5, 97.

As you settle into your seat for a flight to a holiday destination or as part of yet another business trip, it is very easy to become absorbed by the glossy magazines or the novel you've been waiting forever to start reading. Understandably, the phrase "safety features on board this aircraft" triggers a rather unenthusiastic response. But you may be surprised by some of the incredible technology just a few feet away that is there to make sure everything goes smoothly.

 

Wed, 17 Oct 2018
16:00
C1

Graph products of groups

Motiejus Valiunas
(Southampton University)
Abstract

Graph products are a class of groups that 'interpolate' between direct and free products, and generalise the notion of right-angled Artin groups. Given a property that free products (and maybe direct products) are known to satisfy, a natural question arises: do graph products satisfy this property? For instance, it is known that graph products act on tree-like spaces (quasi-trees) in a nice way (acylindrically), just like free products. In the talk we will discuss a construction of such an action and, if time permits, its relation to solving systems of equations over graph products.

Fri, 26 Oct 2018

12:00 - 13:00
L4

Stochastic perturbations of singular polynomial eigenvalue problems

Martin Lotz
(University of Warwick)
Abstract


One occasionally encounters computational problems that work just fine on ill-posed inputs, even though they should not. One example is polynomial eigenvalue problems, where standard algorithms such as QZ can find a desired solution to instances with infinite condition number to machine precision, while being completely oblivious to the ill-conditioning of the problem. One explanation is that, intuitively, adversarial perturbations are extremely unlikely, and "for all practical purposes'' the problem might not be ill-conditioned at all. We analyse perturbations of singular polynomial eigenvalue problems and derive methods to bound the likelihood of adversarial perturbations for any given input in different stochastic models.


Joint work with Vanni Noferini
 

Wed, 17 Oct 2018
11:00
N3.12

Rogers-Ramanujan Type Identities and Partitions

Adam Keilthy
(University of Oxford)
Abstract

In this talk, we shall introduce various identities among partitions of integers, and how these can be expressed via formal power series. In particular, we shall look at the Rogers Ramanujan identities of power series, and discuss possible combinatorial proofs using partitions and Durfree squares.

Subscribe to