# Construction of spherical t-designs

@article{Bajnok1992ConstructionOS, title={Construction of spherical t-designs}, author={B{\'e}la Bajnok}, journal={Geometriae Dedicata}, year={1992}, volume={43}, pages={167-179} }

Spherical t-designs are Chebyshev-type averaging sets on the d-dimensional unit sphere Sd−1, that are exact for polynomials of degree at most t. The concept of such designs was introduced by Delsarte, Goethals and Seidel in 1977. The existence of spherical t-designs for every t and d was proved by Seymour and Zaslavsky in 1984. Although some sporadic examples are known, no general construction has been given. In this paper we give an explicit construction of spherical t-designs on Sd−1…

## 54 Citations

### Constructions of Spherical 3-Designs

- MathematicsGraphs Comb.
- 1998

A lower bound for s(n, 3) is found, and it is shown how Sidon-type sets of strength 3 can be used to construct spherical 3-designs, which are Chebyshev-type averaging sets on the d-sphere.

### Explicit spherical designs

- MathematicsAlgebraic Combinatorics
- 2022

Since the introduction of the notion of spherical designs by Delsarte, Goethals, and Seidel in 1977, ﬁnding explicit constructions of spherical designs had been an open problem. Most existence proofs…

### Spherical designs and finite group representations (some results of E. Bannai

- MathematicsEur. J. Comb.
- 2004

### New spherical (2s+1)-designs from Kuperberg's set: An experimental result

- MathematicsAppl. Math. Comput.
- 2014

### Spherical Designs and Generalized Sum-Free Sets in Abelian Groups

- MathematicsDes. Codes Cryptogr.
- 2000

The concepts of sum-freesets and Sidon-sets of combinatorial number theory are extended to provide explicit constructions for spherical designs and asymptotic bounds for the size of a largest t-free set in Zn are given.

### New Spherical 4-designs

- MathematicsProceedings. IEEE International Symposium on Information Theory
- 1993

### Distribution of the points of a design on the sphere

- Mathematics
- 2005

We determine the size of spherical caps with centres at the points of a design that cover the whole sphere in Euclidean space with a given multiplicity. By projecting -designs on one-dimensional…

### Distribution of the points of a design on the sphere

- Mathematics
- 2005

We determine the size of spherical caps with centres at the points of a design that cover the whole sphere in Euclidean space with a given multiplicity. By projecting -designs on one-dimensional…

### A survey on spherical designs and algebraic combinatorics on spheres

- MathematicsEur. J. Comb.
- 2009

## References

SHOWING 1-10 OF 13 REFERENCES

### A generalized mean-value theorem

- Mathematics
- 1988

We give another proof of Seymour and Zaslavsky's theorem: For every familyf1,f2,...,fn of continous functions defined on [0, 1], there exists a finite setF⊂[0, 1] such that the average sum offk overF…

### Concerning sets of polynomials orthogonal simultaneously on several circles

- Mathematics
- 1939

From the work of Walsh and the authorf we know that if a set of polynomials is orthogonal on two distinct circles, these circles must be concentric, and a very simple relation holds between the…

### A construction of spherical 2-design

- MathematicsGraphs Comb.
- 1990

It is determined for which values ofn andd spherical 2-designs ofn points exist in ℝd. And an explicit construction is given when they exist.

### Higher Transcendental Functions

- PsychologyNature
- 1955

Higher Transcendental FunctionsBased, in part, on notes left by the late Prof. Harry Bateman, and compiled by the Staff of the Bateman Project. Vol. 1. Pp. xxvi + 302. 52s. Vol. 2. Pp. xvii + 396.…