Related papers: Generalized Persistence Diagrams
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…
Let \(\T\) be a commutative ternary \(\Gm\)-semiring in the sense of the triadic, \(\Gm\)-parametrized multiplication \(\{a,b,c\}_{\gamma}\). Building on the affine \(\Gm\)-spectrum \(\SpecG(\T)\), the structure sheaf, and the equivalence…
In this paper, we study properties and patterns on permutations of multisets whose multivariate generating functions are symmetric. We interpret this phenomenon through the lens of group actions and define such a property or pattern as…
We consider principal bundles as generalized morphisms between topological groupoids. In the category of these generalized morphisms two topological groupoids are isomorphic if and only if they are Morita equivalent. We show that the fibers…
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 concept of topological persistence, introduced recently in computational topology, finds applications in studying a map in relation to the topology of its domain. Since its introduction, it has been extended and generalized in various…
We show that given a separable cocontinuous monad on a stable derivator, the levelwise Eilenberg-Moore categories of modules glue together to a stable derivator. As an application, we give examples of derivators that satisfy all the axioms…
We show that a persistence module (for a totally ordered indexing set) consisting of finite-dimensional vector spaces is a direct sum of interval modules. The result extends to persistence modules with the descending chain condition on…
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and…
We define here an analogue, for a semi-stable group scheme whose generic fiber is an abelian variety, of M. J. Taylor's class-invariant homomorphism (defined for abelian schemes), and we give a geometric description of it. Then we extend a…
Constructions of spectra from symmetric monoidal categories are typically functorial with respect to strict structure-preserving maps, but often the maps of interest are merely lax monoidal. We describe conditions under which one can…
We study non-orthogonality of symmetric, regular types and show that it preserves generic stability and is an equivalence relation on the set of all generically stable, regular types. We will also prove that some of the nice properties from…
We set up the theory for a distributed algorithm for computing persistent homology. For this purpose we develop linear algebra of persistence modules. We present bases of persistence modules, and give motivation as for the advantages of…
We study representation stability in the sense of Church, Ellenberg, and Farb \cite{FI-module} through the lens of symmetric function theory and the different symmetric function bases. We show that a sequence, $(F_n)_n$, where $F_n$ is a…
We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…
The theory of persistence modules is an emerging field of algebraic topology which originated in topological data analysis. In these notes we provide a concise introduction into this field and give an account on some of its interactions…
In this note, we give a self-contained account on a construction for a directed homology theory based on modules over algebras, linking it to both persistence homology and natural homology. We study its first properties, among which some…
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…
We study generic graded contractions of Lie algebras from the perspectives of group cohomology, affine algebraic geometry and monoidal categories. We show that generic graded contractions with a fixed support are classified by a certain…
While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…