Related papers: Persistence module and Schubert calculus
We consider random filtered complexes built over marked point processes on Euclidean spaces. Examples of our filtered complexes include a filtration of $\check{\textrm{C}}$ech complexes of a family of sets with various sizes, growths, and…
A method is presented for the distributed computation of persistent homology, based on an extension of the generalized Mayer-Vietoris principle to filtered spaces. Cellular cosheaves and spectral sequences are used to compute global…
Given a pointwise finite-dimensional persistence module over a totally ordered set $S$, a theorem of Crawley-Boevey guarantees the existence of a barcode. When the set $S$ is finite, the persistence module is an equioriented type-A quiver…
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…
We introduce persistence matching diagrams induced by set mappings of metric spaces, based on 0-persistent homology of Vietoris-Rips filtrations. Also, we present a geometric definition of the persistence matching diagram that is more…
The notion of multiplicity of a module first arose as consequence of Hilbert's work on commutative algebra, relating the dimension of rings with the degree of certain polynomials. For noncommutative rings, the notion of multiplicity first…
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of…
Characteristic classes of Schubert varieties can be used to study the geometry and the combinatorics of homogeneous spaces. We prove a relation between elliptic classes of Schubert varieties on a generalized full flag variety and those on…
Persistent homology, a central tool of topological data analysis, provides invariants of data called barcodes (also known as persistence diagrams). A barcode is simply a multiset of real intervals. Recent work of Edelsbrunner, Jablonski,…
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…
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…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
Most algorithms for computing persistent homology do so by tracking cycles that represent homology classes. There are many choices of such cycles, and specific choices have found different uses in applications. Although it is known that…
We introduce the notion of a cominuscule point in a Schubert variety in a generalized flag variety for a semisimple group. We derive formulas expressing the Hilbert series and multiplicity of a Schubert variety at a cominuscule point in…
The notion of generalized rank invariant in the context of multiparameter persistence has become an important ingredient for defining interesting homological structures such as generalized persistence diagrams. Naturally, computing these…
To compute the persistent homology of a grayscale digital image one needs to build a simplicial or cubical complex from it. For cubical complexes, the two commonly used constructions (corresponding to direct and indirect digital…
The persistent homology of a stationary point process on ${\bf R}^N$ is studied in this paper. As a generalization of continuum percolation theory, we study higher dimensional topological features of the point process such as loops,…
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…
We reformulate the persistent (co)homology of simplicial filtrations, viewed from a more algebraic setting, namely as the (co)homology of a chain complex of graded modules over polynomial ring $K[t]$. We also define persistent (co)homology…
Since persistence diagrams do not admit an inner product structure, a map into a Hilbert space is needed in order to use kernel methods. It is natural to ask if such maps necessarily distort the metric on persistence diagrams. We show that…