Related papers: Computing $p$-presentation distances is hard
We introduce an equivalence relation on $W^{s,p}({\mathbb S}^N;{\mathbb S}^N)$ involving the topological degree, and we evaluate the distances (in the usual sense and in the Hausdorff sense) between the equivalence classes. In some special…
We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
Throughout this paper, a persistence diagram ${\cal P}$ is composed of a set $P$ of planar points (each corresponding to a topological feature) above the line $Y=X$, as well as the line $Y=X$ itself, i.e., ${\cal P}=P\cup\{(x,y)|y=x\}$.…
Temporal sequences of terrains arise in various application areas. To analyze them efficiently, one generally needs a suitable abstraction of the data as well as a method to compare and match them over time. In this paper we consider merge…
Multiparameter persistence is a natural extension of the well-known persistent homology, which has attracted a lot of interest. However, there are major theoretical obstacles preventing the full development of this promising theory. In this…
The present work proves that P=NP. The proof, presented in this work, is a constructive one: the program of a polynomial time deterministic multi-tape Turing machine M_ExistsAcceptingPath, that determines if there exists an accepting…
The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the…
Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…
We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…
We establish inequalities that compare the p-Wasserstein distance to distances which are built as suprema of box measures. More precisely, when the measures are supported on $[0,1]^d$, we obtain sharp upper-bounds of the $p$-Wasserstein…
The homotopy interleaving distance, a distance between persistent spaces, was introduced by Blumberg and Lesnick and shown to be universal, in the sense that it is the largest homotopy-invariant distance for which sublevel-set filtrations…
We consider the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets. Our constructions are functorial, which implies a form of stability for these metrics. We describe a large class of…
Time-series of persistence diagrams, known as vineyards, have shown to be useful in diverse applications. A natural algebraic version of vineyards is a time series of persistence modules equipped with interleaving maps between the…
In this paper, we present a novel heuristic algorithm for the stable but NP-complete deformation-based edit distance on merge trees. Our key contribution is the introduction of a user-controlled look-ahead parameter that allows to trade off…
This paper introduces a novel stability measure for edit distances between merge trees of piecewise linear scalar fields. We apply the new measure to various metrics introduced recently in the field of scalar field comparison in scientific…
In this paper we consider the $p$-Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$-norm of its Hamming distances to the strings. Specifically, given a set of…
Tree comparison metrics have proven to be an invaluable aide in the reconstruction and analysis of phylogenetic (evolutionary) trees. The path-length distance between trees is a particularly attractive measure as it reflects differences in…
We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an…
The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…