Related papers: Sums of Squared Distances between Points on a Unit…
A spherical two-distance set is a finite collection of unit vectors in $\reals^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates…
Given a set $S$ consisting of $n$ points in $\mathbb{R}^d$ and one or two vantage points, we study the number of orderings of $S$ induced by measuring the distance (for one vantage point) or the average distance (for two vantage points)…
The center of distances of a metric space $(X,d)$ is the set $C(X)$ of all $t\in \mathbb R^+$ for which the equation $d(x,p)=t$ has a solution for each $p\in X$. We prove the inequality $|C(X)| \le 1 + \lfloor \log_2 n \rfloor$ for all…
Let $\G(v,e)$ be the set of all simple graphs with $v$ vertices and $e$ edges and let $P_2(G)=\sum d_i^2$ denote the sum of the squares of the degrees, $d_1, >..., d_v$, of the vertices of $G$. It is known that the maximum value of $P_2(G)$…
In this paper we study the subset sum problem with real numbers. Starting from the given problem, we formulate a quadratic maximization problem over a polytope, P, which is eventually written as a distance maximization to a fixed point over…
We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…
We give a dimensionality reduction procedure to approximate the sum of distances of a given set of $n$ points in $R^d$ to any "shape" that lies in a $k$-dimensional subspace. Here, by "shape" we mean any set of points in $R^d$. Our…
For the unit sphere S^d in Euclidean space R^(d+1), we show that for d-1<s<d and any N>1, discrete N-point minimal Riesz s-energy configurations are well separated in the sense that the minimal distance between any pair of distinct points…
Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately…
In this paper we prove Schur's conjecture in $\mathbb R^d$, which states that any diameter graph $G$ in the Euclidean space $\mathbb R^d$ on $n$ vertices may have at most $n$ cliques of size $d$. We obtain an analogous statement for…
Consider an arrangement of $n$ congruent zones on the $d$-dimensional unit sphere $S^{d-1}$, where a zone is the intersection of an origin symmetric Euclidean plank with $S^{d-1}$. We prove that, for sufficiently large $n$, it is possible…
In an earlier work we identified the types and numbers of static equilibrium points of solids arising from fine, equidistant $n$-discretrizations of smooth, convex surfaces. We showed that such discretizations carry equilibrium points on…
We prove topological sphere theorems for RCD(n-1, n) spaces which generalize Colding's results and Petersen's result to the RCD setting. We also get an improved sphere theorem in the case of Einstein stratified spaces.
New condition is found for the set of points in the plane, for which the locus is a circle. It is proved: the locus of points, such that the sum of the $(2m)$-th powers $S_n^{(2m)}$}of the distances to the vertexes of fixed regular…
The scheme for construction of distances, presented in the previous paper quant-ph/0005087, v.1 (Ref. 1) is amended. The formulation of Proposition 1 of Ref. 1 does not ensure the triangle inequality, therefore some of the functionals…
We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…
This letter characterizes the statistics of the contact distance and the nearest neighbor (NN) distance for binomial point processes (BPP) spatially-distributed on spherical surfaces. We consider a setup of $n$ concentric spheres, with each…
In this paper we study the boundedness of extension operators associated with spheres in vector spaces over finite fields.In even dimensions, we estimate the number of incidences between spheres and points in the translated set from a…
The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…
It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…