Interval Multiplicities of Persistence Modules
Hideto Asashiba (1, 2, 3), Enhao Liu (4) ((1) Department of Mathematics, Shizuoka University, (2) Osaka Central Advanced Mathematical Institute, Osaka Metropolitan University, (3) Institute for Advanced Study, Kyoto University, (4) Department of Mathematics, Kyoto University)

TL;DR
This paper provides a generalized formula for computing the multiplicities of interval modules in persistence modules over finite posets, enabling efficient decomposition analysis and property study without full module decomposition.
Contribution
It introduces a new formula for interval multiplicities in persistence modules over arbitrary finite posets, extending 1D persistence results and improving computational efficiency.
Findings
Formula for multiplicities using matrix ranks
Method to determine interval-decomposability
Efficient computation via poset maps and resolutions
Abstract
For any persistence module over a finite poset , and any interval of , we give a formula of the multiplicity of the interval module in the indecomposable decomposition of in terms of the ranks of matrices consisting of structure linear maps of the module , which gives a generalization of the corresponding formula for 1-dimensional persistence modules. As an easy application, the formula enables us to compute the maximal interval-decomposable direct summand of , which gives us a way to decide whether is interval-decomposable or not. In addition, when a set of interval direct summands of gives a specific property of , we can study this property by directly computing the multiplicities by our formula without decomposing . Moreover, the formula tells us which morphisms of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis
