Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the complexity of zero-dimensional multiparameter persistence

Published 26 Aug 2020 in math.AT, math.CO, and math.RT | (2008.11532v1)

Abstract: Multiparameter persistence is a natural extension of the well-known persistent homology, which has attracted a lot of interest. However, there are major theoretical obstacles preventing the full development of this promising theory. In this paper we consider the interesting special case of multiparameter persistence in zero dimensions which can be regarded as a form of multiparameter clustering. In particular, we consider the multiparameter persistence modules of the zero-dimensional homology of filtered topological spaces when they are finitely generated. Under certain assumptions, we characterize such modules and study their decompositions. In particular we identify a natural class of representations that decompose and can be extended back to form zero-dimensional multiparameter persistence modules. Our study of this set of representations concludes that despite the restrictions, there are still infinitely many classes of indecomposables in this set.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.