Spherical two-distance sets
From MaRDI portal
Abstract: A set S of unit vectors in n-dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b, and inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical two-distance sets is not exceed n(n+3)/2. This upper bound is known to be tight for n=2,6,22. The set of mid-points of the edges of a regular simplex gives the lower bound L(n)=n(n+1)/2 for g(n. In this paper using the so-called polynomial method it is proved that for nonnegative a+b the largest cardinality of S is not greater than L(n). For the case a+b<0 we propose upper bounds on |S| which are based on Delsarte's method. Using this we show that g(n)=L(n) for 6<n<22, 23<n<40, and g(23)=276 or 277.
Recommendations
Cites work
- scientific article; zbMATH DE number 3874093 (Why is no real title available?)
- scientific article; zbMATH DE number 3895787 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 3234139 (Why is no real title available?)
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Equiangular lines
- New maximal two-distance sets
- On Two-Distance Sets in Euclidean Space
- Spherical codes and designs
Cited in
(38)- SPHERICAL MEANS AND PINNED DISTANCE SETS
- A new proof of a generalization of Gerzon's bound
- On a generalization of distance sets
- A generalization of Gerzon's bound on spherical \(s\)-distance sets
- General embedding problems and two-distance sets in Minkowski planes
- Complex spherical codes with three inner products
- scientific article; zbMATH DE number 3895787 (Why is no real title available?)
- Ranks of matrices with few distinct entries
- Distance Sets on Circles
- Regular two-distance sets
- Maximal 2-distance sets containing the regular simplex
- Constructions of maximum few-distance sets in Euclidean spaces
- On the size of maximal binary codes with 2, 3, and 4 distances
- Sets of complex unit vectors with few inner products and distance-regular graphs
- New maximal two-distance sets
- The two-distance sets in dimension four
- Spherical designs of harmonic index \(t\)
- New Bounds for Spherical Two-Distance Sets
- Towards a proof of the 24-cell conjecture
- New bounds for equiangular lines and spherical two-distance sets
- New upper bounds for equiangular lines by pillar decomposition
- Upper bounds for \(s\)-distance sets and equiangular lines
- Finite two-distance tight frames
- A geometrical characterization of strongly regular graphs
- A generalization of Larman-Rogers-Seidel's theorem
- Bounds on three- and higher-distance sets
- Complex spherical codes with two inner products
- On spherical designs of some harmonic indices
- Bounds on sets with few distances
- Graphs and spherical two-distance sets
- Spherical two-distance sets and eigenvalues of signed graphs
- Semidefinite programming bounds for spherical three-distance sets
- Constructions and restrictions for balanced splittable Hadamard matrices
- scientific article; zbMATH DE number 3874093 (Why is no real title available?)
- An upper bound for the size of \(s\)-distance sets in real algebraic sets
- A survey on spherical designs and algebraic combinatorics on spheres
- Inside s-inner product sets and Euclidean designs
- Majorization and minimal energy on spheres
This page was built for publication: Spherical two-distance sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024353)
