Fri, 07 Feb 2025
15:00
L4

Decomposing Multiparameter Persistence Modules

Jan Jendrysiak
(TU Graz)

Note: we would recommend to join the meeting using the Teams client for best user experience.

Abstract

Dey and Xin (J. Appl.Comput.Top. 2022) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators and relations are distinctly graded. We extend their approach to work on all finitely presented modules and introduce several improvements that lead to significant speed-ups in practice.


Our algorithm is FPT with respect to the maximal number of relations with the same degree and with further optimisation we obtain an O(n3) algorithm for interval-decomposable modules. As a by-product to the proofs of correctness we develop a theory of parameter restriction for persistence modules. Our algorithm is implemented as a software library aida which is the first to enable the decomposition of large inputs.

This is joint work with Tamal Dey and Michael Kerber.

Fri, 14 Feb 2025
15:00
L4

Distance-from-flat persistent homology transforms

Nina Otter
(Inria Saclay)

Note: we would recommend to join the meeting using the Teams client for best user experience.

Abstract
The persistent homology transform (PHT) was introduced in the field of Topological Data Analysis about 10 years ago, and has since been proven to be a very powerful descriptor of Euclidean shapes. The PHT consists of scanning a shape from all possible directions and then computing the persistent homology of sublevel set filtrations of the respective height functions; this results in a sufficient and continuous descriptor of Euclidean shapes. 
 
In this talk I will introduce a generalisation of the PHT in which we consider arbitrary parameter spaces and sublevel-set filtrations with respect to any function. In particular, we study transforms, defined on the Grassmannian AG(m,n) of affine subspaces of n-dimensional Euclidean space, which allow to scan a shape by probing it with all possible affine m-dimensional subspaces P, for fixed dimension m, and by then computing persistent homology of sublevel-set filtrations of the function encoding the distance from the flat P. We call such transforms "distance-from-flat PHTs". I will discuss how these transforms generalise known examples, how they are sufficient descriptors of shapes and finally present their computational advantages over the classical persistent homology transform introduced by Turner-Mukherjee-Boyer. 
Mon, 26 May 2025
15:30
L3

TBC

Dr. Leonardo Tolomeo
(University of Edinburgh)
" "
Explore detailed images and descriptions of each boardgame.
Mon, 09 Jun 2025
12:15
L5

$3$-$(\alpha,\delta)$-Sasaki manifolds and strongly positive curvature

Ilka Agricola
(Philipps-Universität Marburg)
Abstract
$3$-$(\alpha,\delta)$-Sasaki manifolds are a natural generalisation of $3$-Sasaki manifolds, which in dimension $7$ are intricately related to $G_2$ geometry. We show how these are closely related to various types of quaternionic Kähler orbifolds via connections with skew-torsion and an interesting canonical submersion. Making use of this relation we discuss curvature operators and show that in dimension 7 many such manifolds have strongly positive curvature, a notion originally introduced by Thorpe. 

 
Modelling cerebrovascular pathology and the spread of amyloid beta in Alzheimer’s disease
Ahern, A Thompson, T Oliveri, H Lorthois, S Goriely, A Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences volume 481 issue 2311 (02 Apr 2025)

An open invitation from G-Research to join them for their Oxford Pub Quiz to discover the world of Quantitative Finance through an evening of fun and games. You will need a team of up to 4. Prizes up for grabs: You can register here

Wednesday 12th February, 18:00 - 20:00, Oxford (exact location to be confirmed after registration)

1st Place team: £250 Amazon voucher each; 2nd Place team: £100 Amazon voucher each; 3rd Place team: £50 Amazon Voucher each; plus prize rounds throughout the quiz.

Subscribe to