Related papers: Distances from the vertices of a regular simplex

We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a…

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…

Suppose that $K \subseteq \RR^d$ is a 0-symmetric convex body which defines the usual norm $$ \Norm{x}_K = \sup\Set{t\ge 0: x \notin tK} $$ on $\RR^d$. Let also $A\subseteq\RR^d$ be a measurable set of positive upper density $\rho$. We show…

The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the…

Kusner asked if $n+1$ points is the maximum number of points in $\mathbb{R}^n$ such that the $\ell_p$ distance $(1<p<\infty)$ between any two points is $1$. We present an improvement to the best known upper bound when $p$ is large in terms…

This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular $\el$-sided polygon. Using this result, we obtain the closed-form probability…

In the spirit of the Genetics of the Regular Figures, by L. Fejes T\'oth, we prove the following theorem: If $2n$ points are selected in the $n$-dimensional Euclidean ball $B^n$ so that the smallest distance between any two of them is as…

The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the…

For two t-structures $D_{1}=(D_{1}^{\leqslant 0},D_{1}^{\geqslant 1})$ and $D_{2}=(D_{2}^{\leqslant 0},D_{2}^{\geqslant 1})$ with $D_{1}^{\leqslant 0} \subseteq D_{2}^{\leqslant 0}$ on a triangulated category $\mathcal{D}$, we give a…

The paths on the {\bf R$^3$} real Euclidean manifold are defined as 2-dimensional simplicial strips; points are replaced by 2-simplexes and the orbits of the action of a one discrete-parameter group on the base manifold becomes a convex…

We provide a new angle and obtain new results on a class of metrics on length-normalized curves in $d$ dimensions, represented by their unit tangents expressed as a function of arc-length, which are functions from the unit interval to the…

Distance matrices are matrices whose elements are the relative distances between points located on a certain manifold. In all cases considered here all their eigenvalues except one are non-positive. When the points are uncorrelated and…

We study $N$-point rational distance sets ($\textrm{RDS}(N)$) on the parabola $y=x^2$. Previous approaches to the problem include efforts made using elliptic curves and diophantine chains, with successful analysis for $N\leq 4$. We extend…

We study a variant of Erd\H os' unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of nonzero dot…

We consider the problem of computing the (two-sided) Hausdorff distance between the unit $\ell_{p_{1}}$ and $\ell_{p_{2}}$ norm balls in finite dimensional Euclidean space for $1 \leq p_1 < p_2 \leq \infty$, and derive a closed-form formula…

The main purpose of this paper is to explore normality in terms of distances between points and sets. We prove some important consequences on realvalued contractions, i.e. functions not enlarging the distance, showing that as in the…

In the present paper we investigate the Gromov--Hausdorff distances between a bounded metric space $X$ and so called simplex, i.e., a metric space all whose non-zero distances are the same. In the case when the simplex's cardinality does…

We review the relations between distance matrices and isometric embeddings and give simple proofs that distance matrices defined on euclidean and spherical spaces have all eigenvalues except one non-negative. Several generalizations are…

The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many…

In this paper, we investigate the existence of a point in the plane of a unit polygon, that is at rational distance from each vertex of the polygon. A negative answer is obtained in almost all cases.