×

Every 1D persistence module is a restriction of some indecomposable 2D persistence module. (English) Zbl 1460.16013

Summary: A recent work by M. Lesnick and M. Wright [“Interactive visualization of 2D persistence modules”, Preprint, arXiv:1512.00180] proposed a visualisation of 2D persistence modules by using their restrictions onto lines, giving a family of 1D persistence modules. We give a constructive proof that any 1D persistence module with finite support can be found as a restriction of some indecomposable 2D persistence module with finite support. As consequences of our construction, we are able to exhibit indecomposable 2D persistence modules whose support has holes as well as an indecomposable 2D persistence module containing all 1D persistence modules with finite support as line restrictions. Finally, we also show that any finite-rectangle-decomposable \(n\)D persistence module can be found as a restriction of some indecomposable \((n+1)\)D persistence module.

MSC:

16G20 Representations of quivers and partially ordered sets
55N99 Homology and cohomology theories in algebraic topology
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Asashiba, H., Buchet, M., Escolar, E.G., Nakashima, K., Yoshiwaki, M.: On interval decomposability of 2d persistence modules. arXiv preprint arXiv:1812.05261 (2018a)
[2] Asashiba, H.; Escolar, EG; Hiraoka, Y.; Takeuchi, H., Matrix method for persistence modules on commutative ladders of finite type, Jpn. J. Ind. Appl. Math. (2018) · Zbl 1456.55004 · doi:10.1007/s13160-018-0331-y
[3] Assem, I.; Skowronski, A.; Simson, D., Elements of the Representation Theory of Associative Algebras: Volume 1: Techniques of Representation Theory (2006), Cambridge: Cambridge University Press, Cambridge · Zbl 1092.16001
[4] Bjerkevik, H.B.: Stability of higher-dimensional interval decomposable persistence modules. arXiv preprint arXiv:1609.02086 (2016)
[5] Buchet, M., Escolar, E.G.: Realizations of indecomposable persistence modules of arbitrarily large dimension. In: 34th International Symposium on Computational Geometry (SoCG 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018) · Zbl 1493.55002
[6] Butler, MC; Ringel, CM, Auslander-Reiten sequences with few middle terms and applications to string algebras, Commun. Algebra, 15, 1-2, 145-179 (1987) · Zbl 0612.16013 · doi:10.1080/00927878708823416
[7] Carlsson, G.; Zomorodian, A., The theory of multidimensional persistence, Discrete Comput. Geom., 42, 1, 71-93 (2009) · Zbl 1187.55004 · doi:10.1007/s00454-009-9176-0
[8] Chazal, F.; De Silva, V.; Glisse, M.; Oudot, S., The Structure and Stability of Persistence Modules (2016), Berlin: Springer, Berlin · Zbl 1362.55002
[9] Crawley-Boevey, W., Decomposition of pointwise finite-dimensional persistence modules, J. Algebra Appl., 14, 5, 1550066 (2015) · Zbl 1345.16015 · doi:10.1142/S0219498815500668
[10] Dey, T.K., Xin, C.: Computing bottleneck distance for 2-d interval decomposable modules. In: 34th International Symposium on Computational Geometry (SoCG 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018) · Zbl 1492.55005
[11] Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. In: Proceedings of 41st Annual Symposium on Foundations of Computer Science, 2000. IEEE, pp. 454-463 (2000) · Zbl 1011.68152
[12] Gabriel, P., Unzerlegbare darstellungen i, Manuscr. math., 6, 1, 71-103 (1972) · Zbl 0232.08001 · doi:10.1007/BF01298413
[13] Kelly, M., Basic Concepts of Enriched Category Theory (1982), Cambridge: CUP Archive, Cambridge · Zbl 0478.18005
[14] Lesnick, M., Wright, M.: Interactive visualization of 2-d persistence modules. arXiv preprint arXiv:1512.00180 (2015)
[15] Mac Lane, S., Categories for the Working Mathematician (2013), Berlin: Springer, Berlin · Zbl 0232.18001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.