English

On almost-equidistant sets - II

Metric Geometry 2019-04-18 v3 Combinatorics

Abstract

A set in Rd\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\'angi claiming that an almost-equidistant set lying on a (d1)(d-1)-dimensional sphere of radius rr, where r<1/2r<1/\sqrt{2}, has at most 2d+22d+2 points. Second, we prove that an almost-equidistant set VV in Rd\mathbb R^d has O(d)O(d) points in two cases: if the diameter of VV is at most 11 or if VV is a subset of a dd-dimensional ball of radius at most 1/2+cd2/31/\sqrt{2}+cd^{-2/3}, where c<1/2c<1/2. Also, we present a new proof of the result of Kupavskii, Mustafa and Swanepoel arXiv:1708.01590 that an almost-equidistant set in Rd\mathbb R^d has O(d4/3)O(d^{4/3}) elements.

Keywords

Cite

@article{arxiv.1708.02039,
  title  = {On almost-equidistant sets - II},
  author = {Alexandr Polyanskii},
  journal= {arXiv preprint arXiv:1708.02039},
  year   = {2019}
}

Comments

8 pages. All proofs are simplified. Open problems are added. Key words: equidistant sets, almost-equidistant sets, unit distance graph, diameter graph, triangle-free graph, Perron-Frobenius Theorem. To appear in the Electronic Journal of Combinatorics

R2 v1 2026-06-22T21:08:24.725Z