Related papers: Differentiable distance spaces
We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…
Nearest neighbor cells in $R^d,d\in\mathbb{N}$, are used to define coefficients of divergence ($\phi$-divergences) between continuous multivariate samples. For large sample sizes, such distances are shown to be asymptotically normal with a…
A graph $G=(V,E)$ on $n$ vertices is said to be \emph{distance exceptional} if the equation $D\vec{x} = \vec{1}$ admits no solution $\vec{x}\in\mathbb{R}^{n}$, where $D\in\mathbb{R}^{n\times n}$ is the shortest path distance matrix of $G$.…
In this paper we study isometry-invariant Finsler metrics on inner product spaces over $\mathbb{R}$ or $\mathbb{C}$, i.e. the Finsler metrics which do not change under the action of all isometries of the inner product space. We give a new…
Geometric characteristics of metric spaces that appear in formulas of the Gromov--Hausdorff distances from these spaces to so-called simplexes, i.e., to the metric spaces, all whose non-zero distances are the same are studied. The…
Data consisting of a graph with a function mapping into $\mathbb{R}^d$ arise in many data applications, encompassing structures such as Reeb graphs, geometric graphs, and knot embeddings. As such, the ability to compare and cluster such…
For a family $\mathcal{C}$ of properly embedded curves in the 2-dimensional disk $\mathbb{D}^{2}$ satisfying certain uniqueness properties, we consider convex polygons $P\subset \mathbb{D}^{2}$ and define a metric $d$ on $P$ such that…
We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…
The emergence of generalized square metrics in Finsler geometry can be attributed to various classification concerning ({\alpha}, \beta})-metrics. They have excellent geometric properties in Finsler geometry. Within the scope of this…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
A characterization of the proximal normal cone is obtained and a separation theorem for convex subsets of Riemannian manifolds is established. Moreover, the convexity of the distance function $d_S$ for a convex subset $S$ in the cases where…
A Finsler metric is geodesically reversible if geodesics remain geodesics after a change of orientation. Asymmetric norms on vector spaces and Funk metrics in the interior of convex bodies are examples of geodesically reversible metrics…
The paper studies the class of all metric spaces considered up to zero Gromov-Hausdorff distance between them. In this class, we examine clouds - classes of spaces situated at finite Gromov-Hausdorff distances from a reference space. We…
We show that a small perturbation of the boundary distance function of a simple Finsler metric on the $n$-disc is also the boundary distance function of some Finsler metric. (Simple metric form an open class containing all flat metrics.)…
We study convexity properties of distance functions in Finsler unitary groups, where the Finsler structure is defined by translation of the $p$-Schatten norm on the Lie algebra. As a result we prove the existence of circumcenters for sets…
Diffeological and differential spaces are generalisations of smooth structures on manifolds. We show that the "intersection" of these two categories is isomorphic to Fr\"olicher spaces, another generalisation of smooth structures. We then…
In this paper we parallelly build up the theories of normed linear spaces and of linear spaces with indefinite metric, called also Minkowski spaces for finite dimensions in the literature. In the first part of this paper we collect the…
Background: Functional connectomes (FCs), have been shown to provide a reproducible individual fingerprint, which has opened the possibility of personalized medicine for neuro/psychiatric disorders. Thus, developing accurate ways to compare…
A {\em faithful (unit) distance graph} in $\mathbb{R}^d$ is a graph whose set of vertices is a finite subset of the $d$-dimensional Euclidean space, where two vertices are adjacent if and only if the Euclidean distance between them is…
Given two simplicial complexes in R^d, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Fr\'echet distance between these curves is minimized. As a polygonal…