Spherical design

A spherical design, part of combinatorial design theory in mathematics, is a finite set of N points on the d-dimensional unit d-sphere S^d such that the average value of any polynomial f of degree t or less on the set equals the average value of f on the whole sphere (that is, the integral of f over S^d divided by the area or measure of S^d). Such a set is often called a spherical t-design to indicate the value of t, which is a fundamental parameter. The concept of a spherical design is due to Delsarte, Goethals, and Seidel (1977), although these objects were understood as particular examples of cubature formulas earlier.

Spherical designs can be of value in approximation theory, in statistics for experimental design, in combinatorics, and in geometry. The main problem is to find examples, given d and t, that are not too large; however, such examples may be hard to come by. Spherical t-designs have also recently been appropriated in quantum mechanics in the form of quantum t-designs with various applications to quantum information theory and quantum computing.

Existence of spherical designs

The existence and structure of spherical designs on the circle were studied in depth by Hong (1982). Shortly thereafter, Seymour and Zaslavsky (1984) proved that such designs exist of all sufficiently large sizes; that is, given positive integers n and t, there is a number N(d,t) such that for every N ≥ N(d,t) there exists a spherical t-design of N points in dimension d. However, their proof gave no idea of how big N(d,t) is.

Mimura constructively found conditions in terms of the number of points and the dimension which characterize exactly when spherical 2-designs exist. Maximally sized collections of equiangular lines (up to identification of lines as antipodal points on the sphere) are examples of minimal sized spherical 5-designs. There are many sporadic small spherical designs; many of them are related to finite group actions on the sphere.

In 2013 Bondarenko, Radchenko, and Viazovska obtained the asymptotic upper bound ${\displaystyle N(d,t)<C_{d}t^{d}}$ for all positive integers d and t. This asymptotically matches the lower bound given originally by Delsarte, Goethals, and Seidel. The value of C_d is currently unknown, while exact values of ${\displaystyle N(d,t)}$ are known in relatively few cases.

See also

• Thomson problem

External links

• Spherical t-designs for different values of N and t can be found precomputed at Neil Sloane's website.

Notes

References

• Bondarenko, Andriy; Radchenko, Danylo; Viazovska, Maryna (2013), "Optimal asymptotic bounds for spherical designs", Annals of Mathematics, Second Series, 178 (2): 443–452, arXiv:1009.4407, doi:10.4007/annals.2013.178.2.2, MR 3071504.
• Mimura, Yoshio (1990), "A construction of spherical 2-design", Graphs and Combinatorics, 6 (4): 369–372, doi:10.1007/BF01787704.
• Delsarte, P.; Goethals, J. M.; Seidel, J. J. (1977), "Spherical codes and designs", Geometriae Dedicata, 6 (3): 363–388, MR 0485471. Reprinted in Seidel, J. J. (1991), Geometry and combinatorics: Selected works of J. J. Seidel, Boston, MA: Academic Press, Inc., ISBN 0-12-189420-7, MR 1116326.
• Hong, Yiming (1982), "On spherical t-designs in R²", European Journal of Combinatorics, 3 (3): 255–258, doi:10.1016/S0195-6698(82)80036-X, MR 0679209.
• Seymour, P. D.; Zaslavsky, Thomas (1984), "Averaging sets: a generalization of mean values and spherical designs", Advances in Mathematics, 52 (3): 213–240, doi:10.1016/0001-8708(84)90022-7, MR 0744857.