Related papers: The reflection distance between zigzag persistence…
We provide a definition of ephemeral multi-persistent modules and prove that the quotient of persistent modules by the ephemeral ones is equivalent to the category of $\gamma$-sheaves. In the case of one-dimensional persistence, our…
A $1$-Lipschitz map between compact metric spaces $f\colon X\to Y$ induces a homomorphism of persistence modules on degree-$d$ Vietoris--Rips persistent homology. We define the persistent cost of $f$ from this induced homomorphism by…
The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…
Interleaving distances provide a fundamental tool for comparing persistence modules and have been widely used in topological data analysis. Their definitions are typically based on translation structures (shift operations) on the indexing…
The resistance between two nodes in some resistor networks has been studied extensively by mathematicians and physicists. Let $L_n$ be a linear hexagonal chain with $n$\, 6-cycles. Then identifying the opposite lateral edges of $L_n$ in…
We study the first extension groups between Verma modules. There was a conjecture which claims that the dimensions of the higher extension groups between Verma modules are the coefficients of $R$-polynomials defined by Kazhdan-Lusztig. This…
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…
The concept of cone metric spaces with $w-$distance was introduced by H. Lakzian and F. Arabyani [16] in $2009.$ In $2020,$ Branga and Olaru [4] put forth the idea of cone metric spaces over topological module. In this paper, we compose…
The matching distance is a pseudometric on multi-parameter persistence modules, defined in terms of the weighted bottleneck distance on the restriction of the modules to affine lines. It is known that this distance is stable in a reasonable…
The Lorentzian distance formula, conjectured several years ago by Parfionov and Zapatrin, has been recently proved by the second author. In this work we focus on the derivation of an equivalent expression in terms of the geometry of…
The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the…
Persistence modules that decompose into interval modules are important in topological data analysis because we can interpret such intervals as the lifetime of topological features in the data. We can classify the settings in which…
In this note we compute length, support and dimension of syzygy modules of certain modules. This partially answers questions asked by Huneke et al.
By a method inspired of the Stein's method, we derive an upper-bound of the Rubinstein distance between two absolutely continuous probability measures on configurations space. As an application, we show that the best way to approximate a…
Rosenthal et al. introduced and thoroughly studied the notion of Maximum Distance Profile (MDP) convolutional codes over (non-binary) finite fields refining the classical notion of optimum distance profile, see for instance [18, p.164].…
Recently, the first author together with Jens Marklof studied generalizations of the classical three distance theorem to higher dimensional toral rotations, giving upper bounds in all dimensions for the corresponding numbers of distances…
As in the case of minimal surfaces in the Euclidean 3-space, the reflection principle for maximal surfaces in the Lorentz-Minkowski 3-space asserts that if a maximal surface has a spacelike line segment $L$, the surface is invariant under…
This paper explores persistence modules for circle-valued functions, presenting a new extension of the interleaving and bottleneck distances in this setting. We propose a natural generalisation of barcodes in terms of arcs on a geometric…
Given a metric pair $(X,A)$, i.e. a metric space $X$ and a distinguished closed set $A \subset X$, one may construct in a functorial way a pointed pseudometric space $\mathcal{D}_\infty(X,A)$ of persistence diagrams equipped with the…
We use weights on objects in an abelian category to define what we call a path metric. We introduce three special classes of weight: those compatible with short exact sequences; those induced by their path metric; and those which bound…