Abstract

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.

Highlights

  • A set in Rd is called almost-equidistant if among any three points in the set, some two are at unit distance apart

  • An almost-equidistant diameter set in Rd has at most 2d + 4 points

  • A graph (V, E) is called a diameter graph if its vertex set V ⊆ Rd is a set of points of diameter 1 and a pair of vertices forms an edge if they are at unit distance apart

Read more

Summary

Introduction

A set in Rd is called almost-equidistant if among any three points in the set, some two are at unit distance apart. Note that the set of the vertice√s of two unit (d − 1)-simplices lying on the same (d − 1)dimensional sphere of radius 1/ 2 is almost-equidistant. Por, Scheucher, Swanepoel and Valtr [1, Theorem 6] showed that an almost equidistant set in Rd has O(d3/2) points. This bound was improved by the author [12, Theorem 1] to O(d13/9). The first goal of this paper is to give a short proof of the result of Bezdek–Langi [2] using a lifting argument and the fact that an almost-equidistant set on a (d−1)-dimensional sphere has at most 2d points. We discuss several open problems related to almost-equidistant sets (see Section 7)

Preliminaries
A simple proof of the result of Bezdek and Langi
Almost-equidistant diameter sets
Almost-equidistant sets in small balls
Almost-equidistant sets: general case
Two-distant almost-equidistant sets
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.