Related papers: On Level persistence (Relevant level persistence n…
Persistent homology (PH) is a rigorous mathematical theory that provides a robust descriptor of data in the form of persistence diagrams (PDs) which are 2D multisets of points. Their variable size makes them, however, difficult to combine…
We extend the results of Adcock, Carlsson, and Carlsson by constructing numeric invariants from the computation of a multidimensional persistence module as given by Carlsson, Singh, and Zomorodian.
Computational topology provides a tool, persistent homology, to extract quantitative descriptors from structured objects (images, graphs, point clouds, etc). These descriptors can then be involved in optimization problems, typically as a…
The purpose of this note is to show that the subvarieties of small degree inside a general hypersurface of large degree come from intersecting with linear spaces or other varieties.
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…
We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…
By extending the approach of Berry and Robnik, the limiting level spacing distribution of a system consisting of infinitely many independent components is investigated. The limiting level spacing distribution is characterized by a single…
In this paper, we study the persistent homology of the offset filtration of algebraic varieties. We prove the algebraicity of two quantities central to the computation of persistent homology. Moreover, we connect persistent homology and…
We establish a connection between barcode entropy and metric entropy. Namely, we show that the barcode entropy bounds the metric entropy from below for a measure from a specific class of invariant measures associated with a pair of…
Many topological data analysis (TDA) pipelines compute large collections of persistence diagrams, yet vectorizations and kernel methods discard the rank-induced implication relations among persistence intervals that are essential for…
In reliability theory and survival analysis, the residual entropy is known as a measure suitable to describe the dynamic information content in stochastic systems conditional on survival. Aiming to analyze the variability of such…
The extended persistence diagram introduced by Cohen-Steiner, Edelsbrunner, and Harer is an invariant of real-valued continuous functions, which are $\mathbb{F}$-tame in the sense that all open interlevel sets have degree-wise…
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work.…
Certain classes of multiparameter persistence modules may be encoded as signed barcodes, represented as points in a polyhedral subset of Euclidean space, we refer to as signed persistence diagrams. These signed persistence diagrams exist in…
We introduce topological conditions on a broad class of functionals that ensure that the persistent homology modules of their associated sublevel set filtration admit persistence diagrams, which, in particular, implies that they satisfy…
Topological data analysis provides a multiscale description of the geometry and topology of quantitative data. The persistence landscape is a topological summary that can be easily combined with tools from statistics and machine learning.…
We define a class of invariants, which we call homological invariants, for persistence modules over a finite poset. Informally, a homological invariant is one that respects some homological data and takes values in the free abelian group…
Based on some analogies with the Hodge theory of isolated hypersurface singularities, we define Hodge-type numerical invariants (called H-numbers) of any, not necessarily algebraic, link in $S^3$. They contain the same information as the…
We introduce a family of scale-invariant entropy statistics derived from logarithmically aggregated distance distributions of point processes, with prime numbers serving as a motivating example. The construction associates to each finite…
In this paper, we propose a general framework that extends the theory of permutation patterns to higher dimensions and unifies several combinatorial objects studied in the literature. Our approach involves introducing the concept of a…