Related papers: Stabilizing decomposition of multiparameter persis…
Recently, bipath persistent homology has been proposed as an extension of standard persistent homology, along with its visualization (bipath persistence diagram) and computational methods. In the setting of standard persistent homology, the…
We define a simple, explicit map sending a morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to a matching between the barcodes of $M$ and $N$. Our main result is that, in a precise sense, the quality of this…
As modern engineering systems grow in complexity, attitudes toward a modular design approach become increasingly more favorable. A key challenge to a modular design approach is the certification of robust stability under uncertainties in…
We study polynomial and exponential stability for $C_{0}$-semigroups using the recently developed theory of operator-valued $(L^{p},L^{q})$ Fourier multipliers. We characterize polynomial decay of orbits of a $C_{0}$-semigroup in terms of…
Persistence modules that decompose into interval modules are important in topological data analysis because we can interpret such intervals as the lifetime of topological features in the data. We can classify the settings in which…
The stability of topological persistence is one of the fundamental issues in topological data analysis. Numerous methods have been proposed to address the stability of persistent modules or persistence diagrams. Recently, the concept of…
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…
We investigate the existence of sufficient local conditions under which poset representations decompose as direct sums of indecomposables from a given class. In our work, the indexing poset is the product of two totally ordered sets,…
We consider the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets. Our constructions are functorial, which implies a form of stability for these metrics. We describe a large class of…
This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…
In this paper we explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate this process by constructing stable invariants for multi-parameter persistence modules with respect to…
We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for $\mathbb{R}$-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show…
In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must…
The existence of a fundamental length (or fundamental time) has been conjectured in many contexts. However, the "stability of physical theories principle" seems to be the one that provides, through the tools of algebraic deformation theory,…
We study stability and bifurcations in holomorphic families of polynomial automorphisms of C^2. We say that such a family is weakly stable over some parameter domain if periodic orbits do not bifurcate there. We first show that this defines…
A new concept, decomposition-unstable (DU) variety of a parametric polynomial system, is introduced in this paper and the stabilities of several triangular decomposition methods, such as characteristic set decomposition, relatively…
The Isometry Theorem of Chazal et al. and Lesnick is a fundamental result in persistence theory, which states that the interleaving distance between two one-parameter persistence modules is equal to the bottleneck distance between their…
The existence of a fundamental length (or fundamental time) has been conjectured in many contexts. However, the "stability of physical theories principle" seems to be the one that provides, through the tools of algebraic deformation theory,…
In 2020, Cochoy and Oudot got the necessary and sufficient condition of the block-decomposition of 2-parameter persistence modules $\mathbb{R}^2 \to \textbf{Vec}_{\Bbbk}$. And in 2024, Lebovici, Lerch and Oudot resolve the problem of…
In the persistent homology of filtrations, the indecomposable decompositions provide the persistence diagrams. However, in almost all cases of multidimensional persistence, the classification of all indecomposable modules is known to be a…