{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T03:01:26Z","timestamp":1781665286329,"version":"3.54.5"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/R018472\/1"],"award-info":[{"award-number":["EP\/R018472\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Appl. and Comput. Topology"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.\n We also generalise the algorithm and results described above to work for zizag modules.<\/jats:p>","DOI":"10.1007\/s41468-022-00094-6","type":"journal-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T05:04:53Z","timestamp":1657688693000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The space of barcode bases for persistence modules"],"prefix":"10.1007","volume":"7","author":[{"given":"Emile","family":"Jacquard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vidit","family":"Nanda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrike","family":"Tillmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"94_CR1","doi-asserted-by":"crossref","unstructured":"Asashiba, H., Escolar, E.G., Hiraoka, Y., Takeuchi, H.: Matrix method for persistence modules on commutative ladders of finite type. Jpn. J. Ind. Appl. Math. 36(1), 97\u2013130 (2018)","DOI":"10.1007\/s13160-018-0331-y"},{"key":"94_CR2","unstructured":"Buchet, M., Escolar, E.G.: Realizations of indecomposable persistence modules of arbitrarily large dimension. In: 34th International Symposium on Computational Geometry, volume\u00a099 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No.15, 13. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, (2018)"},{"key":"94_CR3","first-page":"104","volume":"I","author":"M Brion","year":"2012","unstructured":"Brion, M.: Representations of quivers. Geometric methods in representation theory I, 104\u2013144 (2012)","journal-title":"Geometric methods in representation theory"},{"key":"94_CR4","unstructured":"Carlsson, G., Dwaraknath, A., Nelson, B.J.: Persistent and zigzag homology: a matrix factorization viewpoint. arXiv:1911.10693, (2019)"},{"issue":"4","key":"94_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10208-010-9066-0","volume":"10","author":"G Carlsson","year":"2010","unstructured":"Carlsson, G., de Silva, V.: Zigzag persistence. Found. Comput. Math. 10(4), 367\u2013405 (2010)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"94_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s00454-015-9746-2","volume":"55","author":"EG Escolar","year":"2016","unstructured":"Escolar, E.G., Hiraoka, Y.: Persistence modules on commutative ladders of finite type. Discrete Comput. Geom. 55(1), 100\u2013157 (2016)","journal-title":"Discrete Comput. Geom."},{"key":"94_CR7","doi-asserted-by":"crossref","unstructured":"Gabriel, P.: Unzerlegbare darstellungen I. Manuscripta mathematica 6, 71\u2013104 (1972)","DOI":"10.1007\/BF01298413"},{"key":"94_CR8","unstructured":"Gregorio, A\u00a0De., Guerra, M., Scaramuccia, S., Vaccarino, F.: Parallel decomposition of persistence modules through interval bases, (2021)"},{"key":"94_CR9","unstructured":"Hang, H., Giusti, C., Ziegelmeier, L., Henselman-Petrusek, G.: U-match factorization: sparse homological algebra, lazy cycle representatives, and dualities in persistent (co)homology, (2021)"},{"key":"94_CR10","unstructured":"Hang, H., Mio, W.: Correspondence modules and persistence sheaves: a unifying perspective on one-parameter persistent homology. arXiv:2006.08557, (2020)"},{"key":"94_CR11","unstructured":"Henselman-Petrusek, G.: Matroids and canonical forms: theory and applications. arXiv:1710.06084, (2017)"},{"key":"94_CR12","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00493-006-0027-9","volume":"26","author":"N Linial","year":"2006","unstructured":"Linial, N., Meshulam, R.: Homological connectivity of random 2-complexes. Combinatorica 26, 475\u2013487 (2006)","journal-title":"Combinatorica"},{"key":"94_CR13","doi-asserted-by":"crossref","unstructured":"Zomorodian, A., Carlsson, G.E.: Computing persistence homology. Discrete Comput Geom, 33(2), (2005)","DOI":"10.1007\/s00454-004-1146-y"}],"updated-by":[{"DOI":"10.1007\/s41468-022-00097-3","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000}}],"container-title":["Journal of Applied and Computational Topology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-022-00094-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41468-022-00094-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-022-00094-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,24]],"date-time":"2023-02-24T05:06:37Z","timestamp":1677215197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41468-022-00094-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,13]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["94"],"URL":"https:\/\/doi.org\/10.1007\/s41468-022-00094-6","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s41468-022-00097-3","asserted-by":"object"}]},"ISSN":["2367-1726","2367-1734"],"issn-type":[{"value":"2367-1726","type":"print"},{"value":"2367-1734","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,13]]},"assertion":[{"value":"17 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2022","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s41468-022-00097-3","URL":"https:\/\/doi.org\/10.1007\/s41468-022-00097-3","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}