Bounding the size of an almost-equidistant set in Euclidean space

Kupavskii, Andrey, Mustafa, Nabil H. and Swanepoel, Konrad ORCID: 0000-0002-1668-887X (2019) Bounding the size of an almost-equidistant set in Euclidean space. Combinatorics, Probability and Computing, 28 (2). pp. 280-286. ISSN 0963-5483

Preview

Text - Accepted Version Download (563kB) | Preview

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

Item Type:	Article
Official URL:	https://www.cambridge.org/core/journals/combinator...
Additional Information:	© 2018 Cambridge University Press
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	04 May 2018 09:57
Last Modified:	14 Sep 2024 19:57
Projects:	JCJC- 14-CE25-0016-01
Funders:	ANR SAGA
URI:	http://eprints.lse.ac.uk/id/eprint/87767

Actions (login required)

View Item