On interval decomposability of \(2\)D persistence modules (Q2144457): Difference between revisions

In this paper, the authors focus on a well known problem in the multidimensional persistent homology of filtrations, namely the classification of all indecomposable modules which is known to be a wild problem. More precisely, they consider the subclass of interval-decomposable persistence modules. By introducing the definition of pre-interval representations, they study the relationships between pre-interval, interval, and thin indecomposable representations. They especially show that over the ``equioriented'' commutative 2D grid, these concepts are equivalent and provide a criterion for determining whether or not an \(n\)D persistence module is interval/pre-interval/thin-decomposable without having to explicitly compute decompositions. For 2D persistence modules, they provide an algorithm for determining interval-decomposability,