Linear Programming Bounds for Spherical (k,k)-Designs
From MaRDI portal
Abstract: We derive general linear programming bounds for spherical -designs. This includes lower bounds for the minimum cardinality and lower and upper bounds for minimum and maximum energy, respectively. As applications we obtain a universal bound in sense of Levenshtein for the minimum possible cardinality of a design for fixed dimension and and corresponding optimality result. We also discuss examples and possibilities for attaining the universal bound.
Recommendations
- scientific article; zbMATH DE number 2154097
- Uniqueness of the 120-point spherical 11-design in four dimensions
- Indexes of spherical codes
- On variations of designs
- Solving the Delsarte problem for 4-designs on the sphere \(\mathbb{S}^2 \)
- Computing distance distributions of spherical designs
- scientific article; zbMATH DE number 1189033
- scientific article; zbMATH DE number 2237360
- On linear programming bounds for spherical codes and designs
Cited in
(11)- Extremal polynomials for obtaining bounds for spherical codes and designs
- Upper energy bounds for spherical designs of relatively small cardinalities
- Spherical \((t,t)\)-designs with a small number of vectors
- On polarization of spherical codes and designs
- On Euclidean designs and potential energy
- scientific article; zbMATH DE number 2154097 (Why is no real title available?)
- Covering a sphere and extremal properties of orthogonal polynomials
- Universal upper and lower bounds on energy of spherical designs
- Uniqueness of the 120-point spherical 11-design in four dimensions
- Putatively optimal projective spherical designs with little apparent symmetry
- On linear programming bounds for spherical codes and designs
This page was built for publication: Linear Programming Bounds for Spherical (k,k)-Designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154306)
