An upper bound for the cardinality of an \(s\)-distance set in Euclidean space (Q2567394): Difference between revisions

Let \(X\) be a subset of the Euclidian space \((\mathbb R^n,d)\). Then \(X\) is called an \(s\)-distance set if the cardinality of the set \(\{d(x,y)\mid x,y \in , x \neq y\}\) is equal to \(s\). The authors improve the known upper bound for an \(s\)-distance set in \(\mathbb R^n\) by showing, that if \(X\) is on \(p\) concentric spheres, then \(| X| \leq \sum_{i= 0}^{2p-1} {{m+s-i-1}\choose{s-i}}\). If, furthermore, \(X\) is antipodal, then \(| X| \leq 2\sum_{i= 0}^{p-1} {{m+s-2i-2}\choose{m-1}}\).