Optimality and uniqueness of the \((4,10,1/6)\) spherical code (Q1003633)

Linear programming can be used to obtain many best known bounds for spherical codes, and in some cases even to prove optimality. Here it is shown that linear programming \textit{cannot} be used to prove optimality of a \((4,10,1/6)\) spherical code. Moreover---by utilizing results obtained by the current authors in earlier work such as [Eur. J. Comb. 30, 625--637 (2009; Zbl 1171.94378)]--- it turns out that semidefinite programming \textit{can} be used to prove optimality as well as uniqueness of such a spherical code. The optimal code is the Petersen code.