A minimal design of order 11 on the 3-sphere (Q1585650)

A spherical \(t\)-design on the \(n\)-dimensional Euclidean sphere \({\mathbb{S}}^{n-1}\) is a nonempty finite set \(C \subset {\mathbb{S}}^{n-1}\) such that the average of any polynomial \(f(x)=f(x_1,x_2,\ldots,x_n)\) of degree at most \(t\) on the sphere equals its average on \(C\). In the paper under review, a very interesting specific case is considered. Using linear programming techniques, the author proves that 120 is the minimal possible size of a spherical 11-design on \({\mathbb{S}}^3\). This gives the exact value because the 600-cell realizes such a design. Later, it was proved by \textit{D. Danev} and the reviewer [Arch. Math., to appear] that this realization is unique up to isometry.