On almost-equidistant sets. II

Alexandr Polyanskii¹

¹Moscow Institute of Physics and Technology Institute for Information Transmission Problems RAS

The electronic journal of combinatorics, Tome 26 (2019) no. 2

Résumé

A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and Lángi claiming that an almost-equidistant set lying on a $(d-1)$-dimensional sphere of radius $r$, where $r<1/\sqrt{2}$, has at most $2d+2$ points. Second, we prove that an almost-equidistant set $V$ in $\mathbb R^d$ has $O(d)$ points in two cases: if the diameter of $V$ is at most $1$ or if $V$ is a subset of a $d$-dimensional ball of radius at most $1/\sqrt{2}+cd^{-2/3}$, where $c<1/2$. Also, we present a new proof of the result of Kupavskii, Mustafa and Swanepoel that an almost-equidistant set in $\mathbb R^d$ has $O(d^{4/3})$ elements.

Détail

DOI : 10.37236/8044

Classification : 51K99, 05C55, 52C99
Mots-clés : almost equidistant points, spherical geometry