Related papers: Sums of Squared Distances between Points on a Unit…

We propose a novel method for determining the radius of a spherical surface based on the distances measured between points on this surface. We consider the most general case of determining the radius when the distances are measured with…

In previous work the second author derived an asymptotic formula for the sum of the distances between centers of consecutive Ford spheres. In this paper we extend these results by proving asymptotic formulas for higher moments of the…

Let $f_1,\dots,f_m$ be polynomials in $n$ variables with coefficients in a finite field $\mathbb{F}_q$. We estimate the number of points $\underline{x}$ in $\mathbb{F}_q^n$ such that each value $f_i(\underline{x})$ is a nonzero square in…

Our goal is to identify the type and number of static equilibrium points of solids arising from fine, equidistant $n$-discretrizations of smooth, convex surfaces. We assume uniform gravity and a frictionless, horizontal, planar support. We…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

The average distance from a node to all other nodes in a graph, or from a query point in a metric space to a set of points, is a fundamental quantity in data analysis. The inverse of the average distance, known as the (classic) closeness…

We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…

In this paper, we propose a generalized notion of a distance function, called a $g$-metric. The $g$-metric with degree $n$ is a distance of $n+1$ points, generalizing the ordinary distance between two points and $G$-metric between three…

For two non-congruent regular polygons of the same type, the method of finding the points in the plane at the equal distances to the vertices, is established. The existence of two points with this property is proved for two polygons with a…

A set of unit vectors in $\mathbb{R}^d$ is a called a spherical two-distance set if the inner products of distinct vectors only take two values. In this paper, we give explicit correspondence between spherical two-distance sets and graphs…

We show that the maximum number of unit distances or of diameters in a set of n points in d-dimensional Euclidean space is attained only by specific types of Lenz constructions, for all d >= 4 and n sufficiently large, depending on d. As a…

A distance-squared function is one of the most significant functions in the application of singularity theory to differential geometry. Moreover, distance-squared mappings are naturally extended mappings of distance-squared functions,…

Consider a random $d$-dimensional simplex whose vertices are $d+1$ random points sampled independently and uniformly from the unit sphere in $\mathbb R^d$. We show that the expected sum of solid angles at the vertices of this random simplex…

We consider the problem of estimating the distance between two bodies of volume $\varepsilon$ located inside a $n$-dimensional ball $U$ of unit volume for $n\to\infty$. Let $A$ be a closed set with a smooth boundary of the volume…

We show that, for a constant-degree algebraic curve $\gamma$ in $\mathbb{R}^D$, every set of $n$ points on $\gamma$ spans at least $\Omega(n^{4/3})$ distinct distances, unless $\gamma$ is an {\it algebraic helix} (see Definition 1.1). This…

Let $k\ge 2$ be a fixed integer. We consider sums of type $\sum_{n_1^2+\cdots+ n_k^2\le x} F(n_1,\ldots,n_k)$, taken over the $k$-dimensional spherical region $\{(n_1,\ldots,n_k)\in {\Bbb Z}^k: n_1^2+\cdots+ n_k^2\le x\}$, where $F:{\Bbb…

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…

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…

We show that if an open set in $\mathbb{R}^d$ can be fibered by unit $n$-spheres, then $d \geq 2n+1$, and if $d = 2n+1$, then the spheres must be pairwise linked, and $n \in \left\{ 0, 1, 3, 7 \right\}$. For these values of $n$, we…

We consider point distributions in compact connected two-point homogeneous spaces (Riemannian symmetric spaces of rank one). All such spaces are known, they are the spheres in the Euclidean spaces, the real, complex and quaternionic…