Related papers: Persistent homology with non-contractible preimage…
The combinatorial interpretation of the persistence diagram as a M\"obius inversion was recently shown to be functorial. We employ this discovery to recast the Persistent Homology Transform of a geometric complex as a representation of a…
We present a dynamic data structure for maintaining the persistent homology of a time series of real numbers. The data structure supports local operations, including the insertion and deletion of an item and the cutting and concatenating of…
We introduce the category Pstem[n] of n-stems, with a functor P[n] from spaces to Pstem[n]. This can be thought of as the n-th order homotopy groups of a space. We show how to associate to each simplicial n-stem Q an (n+1)-truncated…
We construct examples of nonresolvable generalized $n$-manifolds, $n\geq 6$, with arbitrary resolution obstruction, homotopy equivalent to any simply connected, closed $n$-manifold. We further investigate the structure of generalized…
In this note, we outline the general development of a theory of symmetric homology of algebras, an analog of cyclic homology where the cyclic groups are replaced by symmetric groups. This theory is developed using the framework of crossed…
Persistent homology analysis, a recently developed computational method in algebraic topology, is applied to the study of the phase transitions undergone by the so-called XY-mean field model and by the phi^4 lattice model, respectively. For…
A definable type of a first-order theory is the same as a section (retraction) of the simplicial path space (decalage) of its space of types viewed as a simplicial topological space; as is well-known, in the category of simplicial sets such…
We compute the topological simple structure set of closed manifolds which occur as total spaces of flat bundles over lens spaces S^l/(Z/p) with fiber an n-dimensjional torus T^n for an odd prime p and l greater or equal to 3, provided that…
Persistent homology is an important methodology in topological data analysis which adapts theory from algebraic topology to data settings. Computing persistent homology produces persistence diagrams, which have been successfully used in…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
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 study the homomorphism induced in homology by a closed correspondence between topological spaces, using projections from the graph of the correspondence to its domain and codomain. We provide assumptions under which the homomorphism…
The subject of persistent homology has vitalized applications of algebraic topology to point cloud data and to application fields far outside the realm of pure mathematics. The area has seen several fundamentally important results that are…
We demonstrate that companionships and conjunctions in double $\infty$-categories -- and more generally, in double Segal spaces -- extend to functors out of the free-living companionship and conjunction respectively. Specifically, we prove…
Given based cellular spaces X and Y, X compact, we define a sequence of increasingly fine equivalences on the based-homotopy set [X,Y].
A topological space is nonseparably connected if it is connected but all of its connected separable subspaces are singletons. We show that each connected first countable space is the image of a nonseparably connected complete metric space…
Persistent homology (PH) studies the topology of data across multiple scales by building nested collections of topological spaces called filtrations, computing homology and returning an algebraic object that can be vizualised as a…
New representations of tree-structured data objects, using ideas from topological data analysis, enable improved statistical analyses of a population of brain artery trees. A number of representations of each data tree arise from…
We construct "barcodes" for the chain complexes over Novikov rings that arise in Novikov's Morse theory for closed one-forms and in Floer theory on not-necessarily-monotone symplectic manifolds. In the case of classical Morse theory these…
We use the theory of persistent homology to analyze a data set arising from the study of various aspects of democracy. Our results show that most "mature" democracies look more or less the same, in the sense that they form a single…