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.
Recommendations
- An upper bound for the cardinality of an s-distance set in Euclidean space
- Upper bounds for \(s\)-distance sets and equiangular lines
- Classification of three-distance sets in two dimensional Euclidean space
- Constructions of maximum few-distance sets in Euclidean spaces
- Bounds on \(s\)-distance sets with strength \(t\)
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- 9-Point and 7-Point Configurations in 3-Space
- A generalization of Larman-Rogers-Seidel's theorem
- A generalization of the ray‐chaudhuri‐wilson theorem
- A note on optimal unimodular lattices
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Bounds on sets with few distances
- Classification of three-distance sets in two dimensional Euclidean space
- Codes on Euclidean spheres
- Designs as maximum codes in polynomial metric spaces
- Four fundamental parameters of a code and their combinatorial significance
- Intersection Properties of Systems of Finite Sets
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- New maximal two-distance sets
- On Two-Distance Sets in Euclidean Space
- On a generalization of distance sets
- On the closets packing of spheres in \(n\) dimensions
- Problems in algebraic combinatorics
- Spherical codes and designs
- Spherical two-distance sets
- Two-point homogeneous spaces
Cited in
(27)- Classification of three-distance sets in two dimensional Euclidean space
- Complex spherical codes with three inner products
- Towards a proof of the 24-cell conjecture
- Bounds on sets with few distances
- Biangular lines revisited
- A characterization of three-interval scaling sets
- Few distance sets in \(\ell_p\) spaces and \(\ell_p\) product spaces
- Maximal m-distance sets containing the representation of the Johnson graph J(n,m)
- Sequence of maximal distance codes in graphs or other metric spaces
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- A proof of a dodecahedron conjecture for distance sets
- Bounds for sets with few distances distinct modulo a prime ideal
- Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
- A generalization of Larman-Rogers-Seidel's theorem
- On the size of maximal binary codes with 2, 3, and 4 distances
- A new upper bound for the size of \(s\)-distance sets in boxes
- scientific article; zbMATH DE number 3977019 (Why is no real title available?)
- Bounds on \(s\)-distance sets with strength \(t\)
- Semidefinite programming bounds for spherical three-distance sets
- Constructions of maximum few-distance sets in Euclidean spaces
- Euclidean sets with only one distance modulo a prime ideal
- Complex spherical codes with two inner products
- Distance Sets on Circles
- Maximal 2-distance sets containing the regular simplex
- On a generalization of distance sets
- Upper bounds for \(s\)-distance sets and equiangular lines
- A geometrical characterization of strongly regular graphs
This page was built for publication: Bounds on three- and higher-distance sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648975)
