Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps

DOI10.1016/J.EJC.2008.07.017MaRDI QIDQ1011505zbMATH OpenOpenAlexFDO

Authors Christine Bachoc, Frank Vallentin

Publication date 8 April 2009

Published in European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite programmingbounds on codeskissing numbersmultivariable orthogonal polynomialscodes in spherical caps

Mathematics Subject Classification ID

Semidefinite programming (90C22) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Semi-infinite programming (90C34) Combinatorial codes (94B25) Bounds on codes (94B65)

Abstract: We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in particular get a new tight bound in dimension 8. Furthermore we show how to use the SDP framework to get analytic bounds.

Recommendations

• Bounds for codes by semidefinite programming
• On linear programming bounds for spherical codes and designs
• Semidefinite programming bounds for binary codes from a split Terwilliger algebra
• Publication:3483796
• Semidefinite programming for permutation codes
• Codes and caps from orthogonal Grassmannians
• A note on semidefinite programming relaxations for polynomial optimization over a single sphere
• Semidefinite programming in combinatorial and polynomial optimization
• Bounds for projective codes from semidefinite programming
• Strengthened semidefinite programming bounds for codes

Cites work

• scientific article; zbMATH DE number 3680654 (Why is no real title available?)
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 527343 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Bounds for codes by semidefinite programming
• CSDP, A C library for semidefinite programming
• Codes in spherical caps
• Linear programming bounds for codes in grassmannian spaces
• 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
• Optimal arrangements in packing congruent balls in a spherical container
• Spherical codes and designs
• Ten-neighbour packing of equal balls
• The one-sided kissing number in four dimension
• Uniqueness of Certain Spherical Codes

Cited in

(15)

• Invariant Semidefinite Programs
• Semidefinite programming bounds for the average kissing number
• On an SDP relaxation for kissing number
• A semidefinite programming hierarchy for packing problems in discrete geometry
• Optimality and uniqueness of the \((4,10,1/6)\) spherical code
• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
• Optimal arrangements of classical and quantum states with limited purity
• Exact Semidefinite Programming Bounds for Packing Problems
• Bounds for projective codes from semidefinite programming
• Towards a proof of the 24-cell conjecture
• New upper bounds for kissing numbers from semidefinite programming
• Three-point bounds for energy minimization
• Codes in spherical caps
• Bounds for codes by semidefinite programming
• A survey on spherical designs and algebraic combinatorics on spheres

Describes a project that uses

Uses Software

• CSDP

This page was built for publication: Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps

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