Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps (Q1011505): Difference between revisions

The authors apply the semidefinite programming approach developed in their previous paper [``New upper bounds for kissing numbers from semidefinite programming'', J. Am. Math. Soc. 21, 909--924 (2008)] to obtain new upper bounds for codes in spherical caps. They compute new upper bounds for the one-sided kissing number in several dimensions where, in particular, they get a new tight bound in dimension 8. Furthermore, they show how to use the semidefinite programming framework to get analytic bounds.