Related papers: Matrix Method for Persistence Modules on Commutati…
We give a description of a weakly continuous rank preserving map on a reflexive algebra on complex Hilbert space with commutative completely distributive subspace lattice. We show that the implementation of a rank preserving map can be…
One-dimensional persistent homology is arguably the most important and heavily used computational tool in topological data analysis. Additional information can be extracted from datasets by studying multi-dimensional persistence modules and…
Matrix theory, foundational in diverse fields such as mathematics, physics, and computational sciences, typically categorizes matrices based strictly on their invertibility-determined by a sharply defined singular or nonsingular…
We characterize the class of persistence modules indexed over $\mathbb{R}^2$ that are decomposable into summands whose support have the shape of a {\em block}---i.e. a horizontal band, a vertical band, an upper-right quadrant, or a…
We conduct a study of real-valued multi-parameter persistence modules as sheaves and cosheaves. Using the recent work on the homological algebra for persistence modules, we define two different convolution operations between derived…
A recent work by Lesnick and Wright proposed a visualisation of $2$D persistence modules by using their restrictions onto lines, giving a family of $1$D persistence modules. We give a constructive proof that any $1$D persistence module with…
Let $R$ be a (not necessarily commutative) ring whose additive group is finitely generated and let $U_n(R) \subset GL_n(R)$ be the group of upper-triangular unipotent matrices over $R$. We study how the homology groups of $U_n(R)$ vary with…
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…
This paper addresses two questions: (a) can we identify a sensible class of 2-parameter persistence modules on which the rank invariant is complete? (b) can we determine efficiently whether a given 2-parameter persistence module belongs to…
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show…
We introduce a theoretical and computational framework to use discrete Morse theory as an efficient preprocessing in order to compute zigzag persistent homology. From a zigzag filtration of complexes $(K_i)$, we introduce a zigzag Morse…
Motivated by recent progress in topological data analysis, we establish a Matlis duality between injective hulls and flat covers of persistence modules. This extends to a duality between minimal flat and minimal injective resolutions. We…
Matrix factorization techniques, especially Nonnegative Matrix Factorization (NMF), have been widely used for dimensionality reduction and interpretable data representation. However, existing NMF-based methods are inherently single-scale…
It is well-known that the cohomology ring has a richer structure than homology groups. However, until recently, the use of cohomology in persistence setting has been limited to speeding up of barcode computations. Some of the recently…
In this paper, we study a class of generalized intersection matrix Lie algebras $\gim(M_n)$, and prove that its every finite-dimensional semi-simple quotient is of type $M(n,{\bf a}, {\bf c},{\bf d})$. Particularly, any finite dimensional…
The $\gamma$-linear projected barcode was recently introduced as an alternative to the well-known fibered barcode for multiparameter persistence, in which restrictions of the modules to lines are replaced by pushforwards of the modules…
This article studies the robust version of persistent homology based on trimming methodology to capture the geometric feature through support of the data in presence of outliers. Precisely speaking, the proposed methodology works when the…
We introduce an efficient, scalable Monte Carlo algorithm to simulate cross-linked architectures of freely-jointed and discrete worm-like chains. Bond movement is based on the discrete tractrix construction, which effects conformational…
We investigate combinatorial dynamical systems on simplicial complexes considered as {\em finite topological spaces}. Such systems arise in a natural way from sampling dynamics and may be used to reconstruct some features of the dynamics…
When filtering a topological space by a single parameter, the theory of quiver representations provides a complete framework for decomposing the resulting persistence module to obtain its barcode. This is achieved by interpreting the…