A remark on sets with few distances in R^d
From MaRDI portal
Publication:5145510
Abstract: A celebrated theorem due to Bannai-Bannai-Stanton says that if is a set of points in , which determines distinct distances, then |A| leq {d+s choose s}. In this note, we give a new simple proof of this result by combining Sylvester's Law of Inertia for quadratic forms with the proof of the so-called Croot-Lev-Pach Lemma from additive combinatorics.
Recommendations
Cites work
- An upper bound for the cardinality of an s-distance subset in real euclidean space
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- On Two-Distance Sets in Euclidean Space
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Upper bounds for \(s\)-distance sets and equiangular lines
Cited in
(4)
This page was built for publication: A remark on sets with few distances in \(\mathbb{R}^d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145510)