New Bounds for Spherical Two-Distance Sets

DOI10.1080/10586458.2013.767725MaRDI QIDQ5299898zbMATH OpenOpenAlexFDO

Authors Alexander Barg, Wei-Hsuan Yu

Publication date 24 June 2013

Published in Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

positive definite matricessemidefinite programmingtwo-distance sets

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Abstract: A spherical two-distance set is a finite collection of unit vectors in $eal{s}^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates of the maximum size of spherical two-distance sets. Exact answers are found for dimensions $n=23$ and $40lenle93;(ne46,78)$ where previous results gave divergent bounds.

Recommendations

• New bounds for equiangular lines and spherical two-distance sets
• Spherical two-distance sets
• A generalization of Gerzon's bound on spherical \(s\)-distance sets
• Bounds for the sum of distances of spherical sets of small size
• New maximal two-distance sets
• scientific article; zbMATH DE number 3895787
• New proofs for some results on spherically convex sets
• New bounds on the dimensions of planar distance sets
• scientific article; zbMATH DE number 5043377

Cites work

• Commutative association schemes
• Equiangular lines
• scientific article; zbMATH DE number 3510705 (Why is no real title available?)
• Invariant Semidefinite Programs
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• New upper bounds for kissing numbers from semidefinite programming
• On Two-Distance Sets in Euclidean Space
• Positive definite functions on spheres
• Spherical codes and designs
• Spherical two-distance sets
• Symmetry in semidefinite programs
• The Closest Packing of Spherical Caps in n Dimensions
• The nonexistence of certain tight spherical designs

Cited in

(26)

• Spherical two-distance sets
• New maximal two-distance sets
• Upper bounds for \(s\)-distance sets and equiangular lines
• Complex spherical codes with three inner products
• Bounds on antipodal spherical designs with few angles
• \(k\)-point semidefinite programming bounds for equiangular lines
• Graphs and spherical two-distance sets
• Finite two-distance tight frames
• Toward the classification of biangular harmonic frames
• Constructions and restrictions for balanced splittable Hadamard matrices
• A characterization of projective unitary equivalence of finite frames and applications
• Bounds on \(s\)-distance sets with strength \(t\)
• Constructions of biangular tight frames and their relationships with equiangular tight frames
• Complex spherical codes with two inner products
• SPHERICAL MEANS AND PINNED DISTANCE SETS
• New upper bounds for equiangular lines by pillar decomposition
• On spherical designs of some harmonic indices
• New bounds for equiangular lines and spherical two-distance sets
• scientific article; zbMATH DE number 5043377 (Why is no real title available?)
• Spherical two-distance sets and eigenvalues of signed graphs
• 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
• Two-numbers and their applications -- a survey
• Set families: restricted distances via restricted intersections
• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4

This page was built for publication: New Bounds for Spherical Two-Distance Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299898)