Journal article icon

Journal article

The space of barcode bases for persistence modules

Abstract:
The barcode of a persistence module serves as a complete combinatorial invariant of its isomorphism class. Barcodes are typically extracted by performing changes of basis on a persistence module until the constituent matrices have a special form. Here we describe a new algorithm for computing barcodes which also keeps track of, and outputs, such a change of basis. Our main result is an explicit characterisation of the group of transformations that sends one barcode basis to another. Armed with knowledge of the entire space of barcode bases, we are able to show that any map of persistence modules can be represented via a partial matching between bars provided that neither source nor target admits nested bars in its barcode. We also generalise the algorithm and results described above to work for zizag modules.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Files:
Publisher copy:
10.1007/s41468-022-00094-6

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Pembroke College
Role:
Author


Publisher:
Springer
Journal:
Journal of Applied and Computational Topology More from this journal
Volume:
7
Pages:
1–30
Publication date:
2022-07-13
Acceptance date:
2022-05-02
DOI:
EISSN:
2367-1734
ISSN:
2367-1726


Language:
English
Keywords:
Pubs id:
1256301
Local pid:
pubs:1256301
Deposit date:
2022-05-06
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP