Semidefinite programming bounds for spherical three-distance sets
From MaRDI portal
Publication:6635166
Cites work
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A generalization of Larman-Rogers-Seidel's theorem
- A note on the tight spherical 7-design in \(\mathbb R^{23}\) and 5-design in \(\mathbb R^7\)
- A survey on spherical designs and algebraic combinatorics on spheres
- An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
- Bounds on three- and higher-distance sets
- Constructions of maximum few-distance sets in Euclidean spaces
- Designs as maximum codes in polynomial metric spaces
- Four fundamental parameters of a code and their combinatorial significance
- New Bounds for Spherical Two-Distance Sets
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New bounds for equiangular lines
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- New upper bounds for kissing numbers from semidefinite programming
- On the closets packing of spheres in \(n\) dimensions
- Semidefinite Programming
- Spherical codes and designs
- Spherical two-distance sets
- The nonexistence of certain tight spherical designs
- The sphere packing problem in dimension \(24\)
- Uniqueness of Certain Spherical Codes
- Uniqueness of the \((22,891,1/4)\) spherical code
- Upper bounds for \(s\)-distance sets and equiangular lines
- Über die Darstellung definiter Formen als Summe von Formenquadraten.
This page was built for publication: Semidefinite programming bounds for spherical three-distance sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635166)
