15:00
Note: we would recommend to join the meeting using the Teams client for best user experience.
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.