Spherical two-distance sets

DOI10.1016/J.JCTA.2008.09.003zbMATH Open1166.51300arXiv0801.3706OpenAlexW2067544741MaRDI QIDQ1024353FDOQ1024353

Oleg R. Musin

Publication date: 17 June 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0801.3706

Recommendations

• New Bounds for Spherical Two-Distance Sets
• Upper bounds for \(s\)-distance sets and equiangular lines
• On a generalization of distance sets
• New maximal two-distance sets
• scientific article; zbMATH DE number 2237360

zbMATH Keywords

polynomial methodtwo-distance setDelsarte method

Mathematics Subject Classification ID

General theory of distance geometry (51K05)

Cites Work

• Title not available (Why is that?)
• Spherical codes and designs
• Equiangular lines
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• New maximal two-distance sets
• Title not available (Why is that?)
• On Two-Distance Sets in Euclidean Space
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (31)

• Complex spherical codes with three inner products
• Towards a proof of the 24-cell conjecture
• Bounds on sets with few distances
• New Upper Bounds for Equiangular Lines by Pillar Decomposition
• A generalization of Larman-Rogers-Seidel's theorem
• Spherical designs of harmonic index \(t\)
• Inside s-inner product sets and Euclidean designs
• On the size of maximal binary codes with 2, 3, and 4 distances
• Graphs and spherical two-distance sets
• A survey on spherical designs and algebraic combinatorics on spheres
• New Bounds for Equiangular Lines and Spherical Two-Distance Sets
• A new proof of a generalization of Gerzon's bound
• Semidefinite programming bounds for spherical three-distance sets
• Title not available (Why is that?)
• The two-distance sets in dimension four
• Constructions of maximum few-distance sets in Euclidean spaces
• Ranks of matrices with few distinct entries
• Regular two-distance sets
• New Bounds for Spherical Two-Distance Sets
• SPHERICAL MEANS AND PINNED DISTANCE SETS
• Complex spherical codes with two inner products
• Bounds on three- and higher-distance sets
• Constructions and restrictions for balanced splittable Hadamard matrices
• Distance Sets on Circles
• Majorization and Minimal Energy on Spheres
• On a generalization of distance sets
• Upper bounds for \(s\)-distance sets and equiangular lines
• A geometrical characterization of strongly regular graphs
• Title not available (Why is that?)
• New maximal two-distance sets
• On spherical designs of some harmonic indices

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)