Generic Multi-Parameter Persistence Modules are Nearly Indecomposable

From MaRDI portal
Revision as of 09:48, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6418712

arXiv2211.15306MaRDI QIDQ6418712FDOQ6418712

Luis Nerio Scoccola, Ulrich Bauer

Publication date: 28 November 2022

Abstract: A fundamental property of one-parameter persistence modules is that the supports of their indecomposable summands form a stable descriptor of the module. This is far from true of two-parameter persistence modules: we show that, in the interleaving distance, any finitely presentable two-parameter persistence module can be approximated arbitrarily well by an indecomposable, and that, generically, two-parameter persistence modules are nearly indecomposable, in the following sense. For every varepsilon>0 there exists a dense and open set consisting of modules that decompose as a direct sum of an indecomposable and an varepsilon-trivial module. These results provide further motivation for approaches to multi-parameter persistence that do not rely on decomposing modules by arbitrary indecomposables.












This page was built for publication: Generic Multi-Parameter Persistence Modules are Nearly Indecomposable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418712)