arXiv subjects
Publications and source records attributed to Maximilian Schmahl.
We show that the interleaving distance between the persistent singular homology and the persistent Čech homology of a homologically locally connected filtration consisting of paracompact Hausdorff spaces is 0.
Using a result by Chazal, Crawley-Boevey and de Silva concerning radicals of persistence modules, we show that every lower semi-continuous q-tame persistence module can be decomposed as a direct sum of interval modules and that every upper semi-continuous q-tame persistence module can be decomposed as a product of interval modules.
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 generalized Morse inequalities. We illustrate the applicability of these results by recasting the original proof of the Unstable Minimal Surface Theorem given by Morse and Tompkins in a modern and rigorous framework.
We present an algorithm for computing the barcode of the image of a morphisms in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes. These algorithms make use of the clearing optimization and can be applied to inclusion-induced maps in persistent absolute homology and persistent relative cohomology for filtrations of pairs of simplicial complexes. They form the basis for our implementation for Vietoris-Rips complexes in the framework of the software Ripser.
We introduce lifespan functors, which are endofunctors on the category of persistence modules that filter out intervals from barcodes according to their boundedness properties. They can be used to classify injective and projective objects in the category of barcodes and the category of pointwise finite-dimensional persistence modules. They also naturally appear in duality results for absolute and relative versions of persistent (co)homology, generalizing previous results in terms of barcodes. Due to their functoriality, we can apply these results to morphisms in persistent homology that are induced by morphisms between filtrations. This lays the groundwork for the efficient computation of barcodes for images, kernels, and cokernels of such morphisms.