Notes on pivot pairings

Research output: Chapter in Book/Report/Conference proceedingConference paper

Abstract

We present a row reduction algorithm to compute the barcode decomposition of persistence modules. This algorithm dualises the standard persistence one and clarifies the symmetry between clear and compress optimisations.
Original languageEnglish
Title of host publicationBook of Abstracts: 37th European Workshop on Computational Geometry
Pages11:1-11:6
Publication statusPublished - Jan 2021
Event37th European Workshop on Computational Geometry - Virtual - St Petersburg, Russia
Duration: 7 Apr 20219 Apr 2021

Conference

Conference37th European Workshop on Computational Geometry
Abbreviated titleEuroCG 2021
Period7/04/219/04/21

Fingerprint

Dive into the research topics of 'Notes on pivot pairings'. Together they form a unique fingerprint.

Cite this