Related papers: Distinct Distances Between a Line and Strip

To quantify the fundamental evolution of time-varying networks, and detect abnormal behavior, one needs a notion of temporal difference that captures significant organizational changes between two successive instants. In this work, we…

We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…

We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…

The proximity $\pi = \pi (G)$ of a connected graph $G$ is the minimum, over all vertices, of the average distance from a vertex to all others. Similarly, the maximum is called the remoteness and denoted by $\rho = \rho (G)$. The concepts of…

We investigate quantifying the difference between two hybrid dynamical systems under noise and initial-state uncertainty. While the set of traces for these systems is infinite, it is possible to symbolically approximate trace sets using…

In data analysis, there is a strong demand for graph metrics that differ from the classical shortest path and resistance distances. Recently, several new classes of graph metrics have been proposed. This paper presents some of them…

Recently, a new distance has been introduced for the graphs of two point-to-set operators, one of which is maximally monotone. When both operators are the subdifferential of a proper lower semicontinuous convex function, this distance…

Measuring the distance between data points is fundamental to many statistical techniques, such as dimension reduction or clustering algorithms. However, improvements in data collection technologies has led to a growing versatility of…

We estimate the distance in the curve graph of a surface S of finite type using Teichmueller geodesics and assuming to be able to detect curves of distance at least three.

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Let $\gamma_1,\gamma_2$ be a pair of constant-degree irreducible algebraic curves in $\mathbb{R}^d$. Assume that $\gamma_i$ is neither contained in a hyperplane nor in a quadric surface in $\mathbb{R}^d$, for each $i=1,2$. We show that for…

Given a continuous function $f:[a,b]\to\mathbb{R}$ such that $f(a)=f(b)$, we investigate the set of distances $|x-y|$ where $f(x)=f(y)$. In particular, we show that the only distances this set must contain are ones which evenly divide…

We introduce the discrete Fr\'echet gap and its variants as an alternative measure of similarity between polygonal curves. We believe that for some applications the new measure (and its variants) may better reflect our intuitive notion of…

We consider the problem of distance between two particles in the universe, where space is taken to be Liebnizian rather than Newtonian, this being the present day approach. We then argue that with latest inputs from physics, it is possible…

A recent generalization of the Erd\H{o}s Unit Distance Problem, proposed by Palsson, Senger and Sheffer, asks for the maximum number of unit distance paths with a given number of vertices in the plane and in $3$-space. Studying a variant of…

We define a special network that exhibits the large embeddings in any class of similar algebras. With the aid of this network, we introduce a notion of distance that conceivably counts the minimum number of dissimilarities, in a sense,…

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

Let $\mathbb{F}_p$ be a prime field, and ${\mathcal E}$ a set in $\mathbb{F}_p^2$. Let $\Delta({\mathcal E})=\{||x-y||: x,y \in {\mathcal E} \}$, the distance set of ${\mathcal E}$. In this paper, we provide a quantitative connection…

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…

A new family of combined subdivision schemes with one tension parameter is proposed by the interpolatory and approximating subdivision schemes. The displacement vectors between the points of interpolatory and approximating subdivision…