Abstract
A finite subsetX of thed-dimensional unit sphereS d-1 is called a sphericalt-design, if and only if
holds for all polynomialsf(x) =f(x 1,x 2,...,x d ) of degree at mostt. In 1984 Seymour and Zaslavsky proved the existence of sphericalt-designs for anyt andd, but for sufficiently large |X|. Since spherical designs can be used for numerical integration, it is of interest to give explicit constructions. Mimura gave a construction fort = 2,d ∈ ℕ and |X| ≥n 2 for somen 2 ∈ ℕ (n 2 is sharp). Here we will give an explicit construction fort = 4 and 5,d ∈ ℕ and |X| ≥n 4 for somen 4 ∈ ℕ.
Similar content being viewed by others
References
Bannai, E., Damerell, R.M.: Tight spherical designs. 1. J. Math. Soc. Japan,31, 199–207 (1979)
Bannai, E., Damerell, R.M.: Tight spherical designs. 2. J. Lond. Math. Soc.21, 13–20 (1980)
Delsarte, P., Goethals, J.M., Seidel, J.J.: Spherical codes and designs. Geom. Dedicata6, 363–388 (1977)
Mimura, Y.: A Construction of spherical 2-designs. (To appear in Graphs and Combinatorics)
Seymour, P.D., Zaslavsky, T.: Averaging sets: A generalization of mean values and spherical designs. Adv. Math.52, 213–240 (1984)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bajnok, B. Construction of spherical 4- and 5-designs. Graphs and Combinatorics 7, 219–233 (1991). https://doi.org/10.1007/BF01787629
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01787629