A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Explicit spherical designs
2022
Algebraic Combinatorics
Since the introduction of the notion of spherical designs by Delsarte, Goethals, and Seidel in 1977, finding explicit constructions of spherical designs had been an open problem. Most existence proofs of spherical designs rely on the topology of the spheres, hence their constructive versions are only computable, but not explicit. That is to say that these constructions can only give algorithms that produce approximations of spherical designs up to arbitrary given precision, while they are not
doi:10.5802/alco.213
fatcat:3563l62wrfbi7k4k3epfrjvq2m