2000 character limit reached
Notes on pivot pairings
Published 2 Jan 2021 in cs.CG and math.AT | (2101.00451v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.