English
Related papers

Related papers: Interval Decomposition of Infinite Zigzag Persiste…

200 papers

Dey and Xin (J.Appl.Comput.Top., 2022, arXiv:1904.03766) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators…

Representation Theory · Mathematics 2025-11-25 Tamal K. Dey , Jan Jendrysiak , Michael Kerber

We apply poset cocalculus, a functor calculus framework for functors out of a poset, to study the problem of decomposing multipersistence modules into simpler components. We both prove new results in this topic and offer a new perspective…

Algebraic Topology · Mathematics 2025-10-09 Bjørnar Gullikstad Hem

Zigzag persistence is a powerful extension of the standard persistence which allows deletions of simplices besides insertions. However, computing zigzag persistence usually takes considerably more time than the standard persistence. We…

Computational Geometry · Computer Science 2022-07-06 Tamal K. Dey , Tao Hou

The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…

Algebraic Topology · Mathematics 2018-10-24 Magnus Bakke Botnan , Michael Lesnick

While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…

Algebraic Topology · Mathematics 2018-12-20 Mickaël Buchet , Emerson G. Escolar

We give formulas for calculating the interleaving distance between rectangle persistence modules that depend solely on the geometry of the underlying rectangles. Moreover, we extend our results to calculate the bottleneck distance for…

Algebraic Topology · Mathematics 2024-11-19 Mehmet Ali Batan , Claudia Landi , Mehmetcik Pamuk

A module $M$ is {called} stable if it has no nonzero projective direct summand. For a ring $ R $, we study conditions under which $R$-modules from certain classes decompose as a direct sum of a projective submodule and a stable submodule.…

Commutative Algebra · Mathematics 2026-04-03 Gulizar Gunay , Engin Mermut

Let $\mathbf{k}$ be a field and let $V: \mathscr{C} \to \mathbf{k}\textup{-Mod}$ be a point-wise finite dimensional persistence modules, where $\mathscr{C}$ is a small category. Assume that for all local Artinian $\mathbf{k}$-algebras $R$…

Category Theory · Mathematics 2024-04-01 José A. Vélez-Marulanda

Let $R$ be a ring, and consider a left $R$-module given with two (generally infinite) direct sum decompositions, $A\oplus(\bigoplus_{i\in I} C_i)=M=B\oplus(\bigoplus_{j\in J} D_j),$ such that the submodules $A$ and $B$ and the $D_j$ are…

Rings and Algebras · Mathematics 2023-01-11 George M. Bergman

We prove that indecomposable $\Sigma$-pure-injective modules for a string algebra are string or band modules. The key step in our proof is a splitting result for infinite-dimensional linear relations.

Rings and Algebras · Mathematics 2017-05-30 Raphael Bennett-Tennenhaus , William Crawley-Boevey

We study direct sum decompositions of modules satisfying the descending chain condition on direct summands. We call modules satisfying this condition Krull-Schmidt artinian. We prove that all direct sum decompositions of Krull-Schmidt…

Rings and Algebras · Mathematics 2014-03-21 Juan Orendain

A direct sum decomposition theory is developed for direct summands (and complements) of modules over a semiring $R$, having the property that $v+w = 0$ implies $v = 0$ and $w = 0$. Although this never occurs when $R$ is a ring, it always…

Rings and Algebras · Mathematics 2015-12-07 Zur Izhakian , Manfred Knebusch , Louis Rowen

In this work, we propose a new invariant for $2$D persistence modules called the compressed multiplicity and show that it generalizes the notions of the dimension vector and the rank invariant. In addition, for a $2$D persistence module…

Representation Theory · Mathematics 2023-08-17 Hideto Asashiba , Emerson G. Escolar , Ken Nakashima , Michio Yoshiwaki

The classical persistence algorithm computes the unique decomposition of a persistence module implicitly given by an input simplicial filtration. Based on matrix reduction, this algorithm is a cornerstone of the emergent area of topological…

Algebraic Topology · Mathematics 2021-12-07 Tamal K. Dey , Cheng Xin

The bedrock of persistence theory over a single parameter is decomposition of persistence modules into intervals. In [HLM24], the authors leveraged interval decomposition to produce a cell decomposition of the minimal model of a simply…

Algebraic Topology · Mathematics 2025-07-04 Kathryn Hess , Samuel Lavenir , Kelly Maggs

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…

Algebraic Topology · Mathematics 2020-08-27 Jacek Brodzki , Matthew Burfitt , Mariam Pirashvili

One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…

Computational Geometry · Computer Science 2021-08-18 Tamal K. Dey , Cheng Xin

Algebraic persistence studies persistence modules (typically, linear representations of the poset $\mathbf{R}^n$ with $n \geq 1$) and the algebraic relationships between persistence modules that are interleaved. The notion of…

Representation Theory · Mathematics 2025-06-24 Ulrich Bauer , Luis Scoccola

We prove rigidity type results on the vanishing of stable (co)homology for modules of finite complete intersection dimension, results which generalize and improve upon known results. We also introduce a notion of pre-rigidity, which…

Commutative Algebra · Mathematics 2009-04-21 Petter Andreas Bergh , David A. Jorgensen

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

Computational Complexity · Computer Science 2009-06-19 Matthew J. Patitz , Scott M. Summers