pith. sign in

arxiv: 1005.2639 · v2 · pith:PJA5OQKKnew · submitted 2010-05-14 · 🧮 math.CO

Bounds on three- and higher-distance sets

classification 🧮 math.CO
keywords setss-distancemaximumspacecardinalitiesdetermineboundbounds
0
0 comments X
read the original abstract

A finite set X in a metric space M is called an s-distance set if the set of distances between any two distinct points of X has size s. The main problem for s-distance sets is to determine the maximum cardinality of s-distance sets for fixed s and M. In this paper, we improve the known upper bound for s-distance sets in n-sphere for s=3,4. In particular, we determine the maximum cardinalities of three-distance sets for n=7 and 21. We also give the maximum cardinalities of s-distance sets in the Hamming space and the Johnson space for several s and dimensions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.