A finite set \(X\) in a metric space \(M\) is 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, the authors improve the known upper bound of \(s\)-distance sets in the \(n\)-sphere for \(s=3,4\) using \textit{O. R. Musin} method [J. Comb. Theory, Ser. A 116, No. 4, 988--995 (2009; Zbl 1166.51300)] with the generalized Larman-Rogers-Seidel theorem and the Nozaki upper bound. In particular, they determine the maximum cardinalities of three-distance sets in \(S^7\) and \(S^{21}\). Moreover, the authors also give the maximum cardinalities of \(s\)-distance sets in the Hamming space and the Johnson space for several \(s\geq 3\) and dimensions.
- 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\)
- 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
- 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?)
- Intersection Properties of Systems of Finite Sets
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- New maximal two-distance sets
- On a generalization of distance sets
- On the closets packing of spheres in \(n\) dimensions
- On Two-Distance Sets in Euclidean Space
- Problems in algebraic combinatorics
- Spherical codes and designs
- Spherical two-distance sets
- Two-point homogeneous spaces
- Upper bounds for \(s\)-distance sets and equiangular lines
- A geometrical characterization of strongly regular graphs
- Classification of three-distance sets in two dimensional Euclidean space
- Complex spherical codes with three inner products
- A proof of a dodecahedron conjecture for distance sets
- Few distance sets in \(\ell_p\) spaces and \(\ell_p\) product spaces
- Maximal 2-distance sets containing the regular simplex
- Biangular lines revisited
- Constructions of maximum few-distance sets in Euclidean spaces
- A new upper bound for the size of \(s\)-distance sets in boxes
- Bounds on sets with few distances
- Bounds on \(s\)-distance sets with strength \(t\)
- scientific article; zbMATH DE number 3977019 (Why is no real title available?)
- Distance Sets on Circles
- Complex spherical codes with two inner products
- Sequence of maximal distance codes in graphs or other metric spaces
- A generalization of Larman-Rogers-Seidel's theorem
- Bounds for sets with few distances distinct modulo a prime ideal
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- On the size of maximal binary codes with 2, 3, and 4 distances
- Semidefinite programming bounds for spherical three-distance sets
- Euclidean sets with only one distance modulo a prime ideal
- Maximal m-distance sets containing the representation of the Johnson graph J(n,m)
- Towards a proof of the 24-cell conjecture
- Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
- Set families: restricted distances via restricted intersections
- On a generalization of distance sets
- A characterization of three-interval scaling sets
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)
