Semidefinite programming bounds for complex spherical codes
Abstract
A complex spherical code is a finite subset on the unit sphere in Cd. 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…,zd,z1,…,zd] in order to obtain the semidefinite programming bounds for complex spherical codes.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.