Bounds on three- and higher-distance sets
From MaRDI portal
Publication:648975
DOI10.1016/J.EJC.2011.03.003zbMATH Open1235.51020arXiv1005.2639OpenAlexW2011415040MaRDI QIDQ648975FDOQ648975
Publication date: 29 November 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1005.2639
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
- Title not available (Why is that?)
- Problems in algebraic combinatorics
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on optimal unimodular lattices
- On the closets packing of spheres in \(n\) dimensions
- Spherical codes and designs
- Two-point homogeneous spaces
- A generalization of Larman-Rogers-Seidel's theorem
- Title not available (Why is that?)
- Classification of three-distance sets in two dimensional Euclidean space
- Four fundamental parameters of a code and their combinatorial significance
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- Intersection Properties of Systems of Finite Sets
- A generalization of the ray‐chaudhuri‐wilson theorem
- Codes on Euclidean spheres
- Designs as maximum codes in polynomial metric spaces
- Spherical two-distance sets
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- New maximal two-distance sets
- On a generalization of distance sets
- On Two-Distance Sets in Euclidean Space
- 9-Point and 7-Point Configurations in 3-Space
- Bounds on sets with few distances
Cited In (17)
- 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
- Biangular lines revisited
- Few distance sets in \(\ell_p\) spaces and \(\ell_p\) product spaces
- A characterization of three-interval scaling sets
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- Bounds for sets with few distances distinct modulo a prime ideal
- On the size of maximal binary codes with 2, 3, and 4 distances
- Title not available (Why is that?)
- Semidefinite programming bounds for spherical three-distance sets
- Constructions of maximum few-distance sets in Euclidean spaces
- Complex spherical codes with two inner products
- Distance Sets on Circles
- Maximal 2-distance sets containing the regular simplex
- 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)
