Related papers: An Algebraic Introduction to Persistence
We study triples of coisotropic or isotropic subspaces in symplectic vector spaces; in particular, we classify indecomposable structures of this kind. The classification depends on the ground field, which we only assume to be perfect and…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distances rather than their actual values. Lower and upper bounds for…
The representation of mathematical objects in terms of (more) basic ones is part and parcel of (the foundations of) mathematics. In the usual foundations of mathematics, i.e. $\textsf{ZFC}$ set theory, all mathematical objects are…
A representation theorem relates different mathematical structures by providing an isomorphism between them: that is, a one-to-one correspondence preserving their original properties. Establishing that the two structures substantially…
A multiplication on persistence diagrams is introduced by means of Schubert calculus. The key observation behind this multiplication comes from the fact that the representation space of persistence modules has the structure of the Schubert…
We study persistence modules defined on commutative ladders. This class of persistence modules frequently appears in topological data analysis, and the theory and algorithm proposed in this paper can be applied to these practical problems.…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…
We can approximate a continuous self-map $f$ of a compact metric space by discretizing the space into a grid. Through either the map itself or a time series, $f$ induces a multivalued grid map $\mathcal F$. The dynamical properties of…
In this paper, we establish a persistence version of the Quillen-McCord theorem for persistence finite posets. Given a map $f \colon P \rightarrow Q$ between persistence finite posets $P$ and $Q$ with weakly $\varepsilon$-contractible…
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…
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show…
We prove a general representation stability result for polynomial coefficient systems which lets us prove representation stability and secondary homological stability for many families of groups with polynomial coefficients. This gives two…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
Theory of representations of F-algebra is a natural development of the theory of F-algebra. Exploring of morphisms of the representation leads to the concepts of generating set and basis of representation. In the book I considered the…
We address the problem of estimating topological features from data in high dimensional Euclidean spaces under the manifold assumption. Our approach is based on the computation of persistent homology of the space of data points endowed with…
We define a simple, explicit map sending a morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to a matching between the barcodes of $M$ and $N$. Our main result is that, in a precise sense, the quality of this…
A number of recent papers treated the representation theory of partially ordered sets in unitary spaces with the so called orthoscalar relation. Such theory generalizes the classical theory which studies the representations of partially…
The embedding theorem arises in several problems from analysis and geometry. The purpose of this paper is to provide a deeper understanding of analysis and geometry with a particular focus on embedding theorems on spaces of homogeneous type…