Bounding the Size of an Almost-Equidistant Set in Euclidean Space - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Combinatorics, Probability and Computing Année : 2019

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

Andrey Kupavskii
Nabil Mustafa
Konrad Swanepoel
  • Fonction : Auteur

Résumé

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).

Domaines

Informatique

Dates et versions

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

Identifiants

Citer

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⟩
93 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More