Related papers: A continuum of K\"unneth theorems for persistence …
We explain a correct proof of the decomposition theorem for direct images of constant Hodge modules by proper K\"ahler morphisms of complex manifolds. We also give some examples showing certain difficulty in the non-constant Hodge module…
We discuss the algebra behind the matrix reduction algorithm for persistent homology, as presented in the paper ''Computing Persistent Homology'' by Afra Zomorodian and Gunnar Carlsson, in the lens of the more modern characterization of…
The use of topological persistence in contemporary data analysis has provided considerable impetus for investigations into the geometric and functional-analytic structure of the space of persistence modules. In this paper, we isolate a…
In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…
Using Banchoff's discrete Morse Theory, in tandem with Bloch's result on the strong connection between the former and Forman's Morse Theory, and our own previous algorithm based on the later, we show that there exists a curvature-based,…
In this paper, we introduce a notion of weight r pseudo-coherent Modules associated to a regular closed immersion i:Y -> X of codimension r, and prove that there is a canonical derived Morita equivalence between the DG-category of perfect…
A family of simplicial complexes, connected with simplicial maps and indexed by a poset $P$, is called a poset tower. The concept of poset towers subsumes classical objects of study in the persistence literature, as, for example,…
In this paper we establish a universal characterization of higher algebraic K-theory in the setting of small stable infinity categories. Specifically, we prove that connective algebraic K-theory is the universal additive invariant, i.e.,…
K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…
We introduce a cohomology theory of grading-restricted vertex algebras. To construct the {\it correct} cohomologies, we consider linear maps from tensor powers of a grading-restricted vertex algebra to "rational functions valued in the…
For any acyclic quiver $Q$ without multiple edges, we construct a monoidal category $\mathcal{R}_Q$ whose indecomposable objects are tensor products (over the base field) of finite-dimensional modules over the path algebra of $Q$. We show…
This article establishes, for an appropriate localisation of associative rings, a long exact sequence in algebraic K-theory. The main result goes as follows. Let A be an associative ring and let A-->B be the localisation with respect to a…
Thom polynomials are universal cohomological obstructions to the appearance of singularities of given types in differentiable maps. As an application, various invariants of immersions have been expressed in terms of singularities of their…
We introduce a new homology theory of uniform spaces, provisionally called $\mu$-homology theory. Our homology theory is based on hyperfinite chains of microsimplices. This idea is due to McCord. We prove that $\mu$-homology theory…
Stiefel-Whitney classes are invariants of the tangent bundle of a smooth manifold, represented as cohomology classes of the base manifold. These classes are essential in obstruction theory, embedding problems, and cobordism theory. In this…
We construct persistent bundles over configuration spaces of hard spheres and use the characteristic classes of these persistent bundles to give obstructions for embedding problems. The configuration spaces of $k$-hard spheres ${\rm…
We present a unified pipeline for univariate time series classification via complex networks and persistent homology. A time series is mapped to a graph through one of five constructions across three families (visibility (natural and…
Criteria are obtained for a filter F of subsets of a set I to be an intersection of finitely many ultrafilters, respectively, finitely many \kappa-complete ultrafilters for a given uncountable cardinal \kappa. From these, general results…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
Persistence modules have a natural home in the setting of stratified spaces and constructible cosheaves. In this article, we first give explicit constructible cosheaves for common data-motivated persistence modules, namely, for modules that…