Semidefinite programming bounds for complex spherical codes

Abstract

A complex spherical code is a finite subset on the unit sphere in C d . A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed inner products. In this paper, we determine the irreducible decomposition under the action of the one-point stabilizer of the unitary group U (d) on the polynomial ring C[z1 . . . , z d , z1, . . . , zd ] in order to obtain the semidefinite programming bounds for complex spherical codes.