Related papers: Distances from the vertices of a regular simplex

We prove that if two finitely generated groups act on a metrically complete 2-dimensional Euclidean building, then the distance between their fixed-point sets is realised. Our proof uses the geometry of Euclidean buildings, which we view as…

It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…

Let $T$ be a tree on $n$ vertices whose edge weights are positive definite matrices of order $s$. The squared distance matrix of $T$, denoted by $\Delta$, is the $ns \times ns$ block matrix with $\Delta_{ij}=d(i,j)^2$, where $d(i,j)$ is the…

There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…

A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Let $X$ be a metric space and $BCl(X)$ the collection of nonempty bounded closed subsets of $X$. We show that Hausdorff distance $d_H$ belongs to a specific family of real-valued distances on $BCl(X)$, each of which can be expressed as the…

Lens spaces are a family of manifolds that have been a source of many interesting phenomena in topology and differential geometry. Their concrete construction, as quotients of odd-dimensional spheres by a free linear action of a finite…

Two vertices of an odd-distance graph are connected by an edge if and only if their Euclidean distance is an odd integer. We construct a 6-chromatic odd-distance graph in the plane.

Fourier series with power series coefficients for the normal and distance to a point from an ellipse are derived. These expressions are the first of their kind and opens up a range of analysis and computational possibilities.

Given a set $X\subseteq\mathbb{R}^2$ of $n$ points and a distance $d>0$, the multiplicity of $d$ is the number of times the distance $d$ appears between points in $X$. Let $a_1(X) \geq a_2(X) \geq \cdots \geq a_m(X)$ denote the…

The luminosity-angular distance relation for an expanding universe is given by $D_L=D_A(1+z)^2$. This relation is commonly proven by geometrical considerations from the source point of view assuming an expanding universe. In this note, the…

The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the vertices $i$ and $j$ in $G$. We consider a weighted tree $T$ on $n$ vertices with edge weights are square matrix of…

An old question posed by Erd\H{o}s asked whether there exists a set of $n$ points such that $c \cdot n$ distances occur more than $n$ times. We provide an affirmative answer to this question, showing that there exists a set of $n$ points…

In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…

The inner product provides a conceptually and algorithmically simple method for calculating the comoving distance between two cosmological objects given their redshifts, right ascension and declination, and arbitrary constant curvature. The…

The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the image of a non-closed geodesic has 0 distance from the set of conical points.…

A set of points in d-dimensional Euclidean space is almost equidistant if among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in $\mathbb{R}^d$ has cardinality $O(d^{4/3})$.

Let $\mathcal{O}_K$ be the ring of integers of an algebraic number field $K$ embedded into $\mathbb{C}$. Let $X$ be a subset of the Euclidean space $\mathbb{R}^d$, and $D(X)$ be the set of the squared distances of two distinct points in…

The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…