Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot
{"title":"通过秩分解和秩精确解析实现多参数持久性的签名条形码","authors":"Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot","doi":"10.1007/s10208-024-09672-9","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we introduce the signed barcode, a new visual representation of the global structure of the rank invariant of a multi-parameter persistence module or, more generally, of a poset representation. Like its unsigned counterpart in one-parameter persistence, the signed barcode decomposes the rank invariant as a <span>\\({\\mathbb {Z}}\\)</span>-linear combination of rank invariants of indicator modules supported on segments in the poset. We develop the theory behind these decompositions, both for the usual rank invariant and for its generalizations, showing under what conditions they exist and are unique. We also show that, like its unsigned counterpart, the signed barcode reflects in part the algebraic structure of the module: specifically, it derives from the terms in the minimal rank-exact resolution of the module, i.e., its minimal projective resolution relative to the class of short exact sequences on which the rank invariant is additive. To complete the picture, we show some experimental results that illustrate the contribution of the signed barcode in the exploration of multi-parameter persistence modules.\n</p>","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":"6 1","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Signed Barcodes for Multi-parameter Persistence via Rank Decompositions and Rank-Exact Resolutions\",\"authors\":\"Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot\",\"doi\":\"10.1007/s10208-024-09672-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we introduce the signed barcode, a new visual representation of the global structure of the rank invariant of a multi-parameter persistence module or, more generally, of a poset representation. Like its unsigned counterpart in one-parameter persistence, the signed barcode decomposes the rank invariant as a <span>\\\\({\\\\mathbb {Z}}\\\\)</span>-linear combination of rank invariants of indicator modules supported on segments in the poset. We develop the theory behind these decompositions, both for the usual rank invariant and for its generalizations, showing under what conditions they exist and are unique. We also show that, like its unsigned counterpart, the signed barcode reflects in part the algebraic structure of the module: specifically, it derives from the terms in the minimal rank-exact resolution of the module, i.e., its minimal projective resolution relative to the class of short exact sequences on which the rank invariant is additive. To complete the picture, we show some experimental results that illustrate the contribution of the signed barcode in the exploration of multi-parameter persistence modules.\\n</p>\",\"PeriodicalId\":55151,\"journal\":{\"name\":\"Foundations of Computational Mathematics\",\"volume\":\"6 1\",\"pages\":\"\"},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2024-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Foundations of Computational Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10208-024-09672-9\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10208-024-09672-9","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Signed Barcodes for Multi-parameter Persistence via Rank Decompositions and Rank-Exact Resolutions
In this paper, we introduce the signed barcode, a new visual representation of the global structure of the rank invariant of a multi-parameter persistence module or, more generally, of a poset representation. Like its unsigned counterpart in one-parameter persistence, the signed barcode decomposes the rank invariant as a \({\mathbb {Z}}\)-linear combination of rank invariants of indicator modules supported on segments in the poset. We develop the theory behind these decompositions, both for the usual rank invariant and for its generalizations, showing under what conditions they exist and are unique. We also show that, like its unsigned counterpart, the signed barcode reflects in part the algebraic structure of the module: specifically, it derives from the terms in the minimal rank-exact resolution of the module, i.e., its minimal projective resolution relative to the class of short exact sequences on which the rank invariant is additive. To complete the picture, we show some experimental results that illustrate the contribution of the signed barcode in the exploration of multi-parameter persistence modules.
期刊介绍:
Foundations of Computational Mathematics (FoCM) will publish research and survey papers of the highest quality which further the understanding of the connections between mathematics and computation. The journal aims to promote the exploration of all fundamental issues underlying the creative tension among mathematics, computer science and application areas unencumbered by any external criteria such as the pressure for applications. The journal will thus serve an increasingly important and applicable area of mathematics. The journal hopes to further the understanding of the deep relationships between mathematical theory: analysis, topology, geometry and algebra, and the computational processes as they are evolving in tandem with the modern computer.
With its distinguished editorial board selecting papers of the highest quality and interest from the international community, FoCM hopes to influence both mathematics and computation. Relevance to applications will not constitute a requirement for the publication of articles.
The journal does not accept code for review however authors who have code/data related to the submission should include a weblink to the repository where the data/code is stored.