Related papers: Distinct Distances Between a Line and Strip
Novel sequences of approximants to solutions of Painlev\'e II on finite intervals of the real line, with Neumann boundary conditions, are constructed. Numerical experiments strongly suggest convergence of these sequences in a surprisingly…
We study the two-player communication problem of determining whether two vertices $x, y$ are nearby in a graph $G$, with the goal of determining the graph structures that allow the problem to be solved with a constant-cost randomized…
We investigate rigidity-type problems on the real line and the circle in the non-generic setting. Specifically, we consider the problem of uniquely determining the positions of $n$ distinct points $V = {v_1, \ldots, v_n}$ given a set of…
The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between topological spaces endowed with continuous real-valued functions. Roughly speaking, the natural pseudo-distance is defined as…
In practical purposes for some geometrical problems in computer science we have as information the coordinates of some finite points in surface instead of the whole body of a surface. The problem arised here is: "How to define a distance…
This work briefly explores the possibility of approximating spatial distance (alternatively, similarity) between data points using the Isolation Forest method envisioned for outlier detection. The logic is similar to that of isolation: the…
When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph,…
Geodesic distance serves as a reliable means of measuring distance in nonlinear spaces, and such nonlinear manifolds are prevalent in the current multimodal learning. In these scenarios, some samples may exhibit high similarity, yet they…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
Pairwise comparison of graphs is key to many applications in Machine learning ranging from clustering, kernel-based classification/regression and more recently supervised graph prediction. Distances between graphs usually rely on…
We consider the Laplacian in a curved two-dimensional strip of constant width squeezed between two curves, subject to Dirichlet boundary conditions on one of the curves and variable Robin boundary conditions on the other. We prove that, for…
In this paper, we derive new sharp diameter bounds for distance regular graphs, which better answer a problem raised by Neumaier and Penji\' c in many cases. Our proof is built upon a relation between the diameter and long-scale Ollivier…
For an unknown continuous distribution on a real line, we consider the approximate estimation by the discretization. There are two methods for the discretization. First method is to divide the real line into several intervals before taking…
In this paper we obtain bounds on a very general class of distance-based topological indices of graphs, which includes the Wiener index, defined as the sum of the distances between all pairs of vertices of the graph, and most…
This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…
The notions of length of a vector field and cosine of the angle between two vector fields over a differentiable manifold with contravariant and covariant affine connections and metrics are introduced and considered. The change of the length…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values…
Dempster-Shafer theory is widely applied in uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. A distance between two basic probability assignments(BPAs) presents a measure of performance…