Bounding the Size of an Almost-Equidistant Set in Euclidean Space - Archive ouverte HAL Access content directly
Journal Articles Combinatorics, Probability and Computing Year : 2019

Bounding the Size of an Almost-Equidistant Set in Euclidean Space

Andrey Kupavskii
Nabil Mustafa
Konrad Swanepoel
  • Function : Author

Abstract

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 ℝd has cardinality O(d4/3).

Dates and versions

hal-01816048 , version 1 (14-06-2018)

Identifiers

Cite

Andrey Kupavskii, Nabil Mustafa, Konrad Swanepoel. Bounding the Size of an Almost-Equidistant Set in Euclidean Space. Combinatorics, Probability and Computing, 2019, pp.1 - 7. ⟨10.1017/S0963548318000287⟩. ⟨hal-01816048⟩
86 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More