A construction of spherical 3-designs
Tsuyoshi Miezaki

TL;DR
This paper presents a new method for constructing spherical 3-designs, extending previous work by Bondarenko, to facilitate better understanding and generation of these mathematical structures.
Contribution
It introduces a generalized construction technique for spherical 3-designs, expanding on Bondarenko's earlier methods.
Findings
Provides a new construction method for spherical 3-designs
Generalizes Bondarenko's previous work
Enables systematic generation of spherical 3-designs
Abstract
We give a construction for spherical 3-designs. This construction is a generalization of Bondarenko's work.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Quasicrystal Structures and Properties
A construction of spherical -designs
Tsuyoshi Miezaki Faculty of Education, University of the Ryukyus, Okinawa 903-0213, Japan [email protected] (Corresponding author)
Abstract
We give a construction for spherical -designs. This construction is a generalization of Bondarenko’s work.
Key Words: Spherical designs, Lattices, Spherical harmonics.
2010 Mathematics Subject Classification. Primary 05B30; Secondary 11H06.
Classification codes according to UDC. 519.1
1 Introduction
This paper is inspired by [1], which gives an optimal antipodal spherical code whose vectors form a spherical -design. To explain our results, we review the concept of spherical -designs and [1].
First, we explain the concept of spherical -designs.
Definition 1.1** ([3]).**
For a positive integer , a finite nonempty set in the unit sphere
[TABLE]
is called a spherical -design in if the following condition is satisfied:
[TABLE]
for all polynomials of degree not exceeding . Here, the righthand side involves the surface integral over the sphere and , the volume of sphere .
The meaning of spherical -designs is that the average value of the integral of any polynomial of degree up to on the sphere can be replaced by its average value over a finite set on the sphere.
The following is an equivalent condition of the antipodal spherical designs:
Proposition 1.1** ([6]).**
An antipodal set in forms a spherical -design if and only if
[TABLE]
An antipodal set in forms a spherical -design if and only if
[TABLE]
Next, we review [1]. Let
[TABLE]
We say that a polynomial in is harmonic if . For integer , the restriction of a homogeneous harmonic polynomial of degree to is called a spherical harmonic of degree . We denote by the vector space of the spherical harmonics of degree . Note that (see for example [6])
[TABLE]
For , we denote by the usual inner product
[TABLE]
where is a normalized Lebesgue measure on the unit sphere . For , there exists such that
[TABLE]
It is known that
[TABLE]
where is a Gegenbauer polynomial. Let
[TABLE]
We remark that
[TABLE]
(For a detailed explanation of Gegenbauer polynomials, see [6].) Therefore, if we have a set in , then we obtain the set in .
Let be an arbitrary subset of normalized minimum vectors of the lattice such that no pair of antipodal vectors is present in . Set . [1] showed that is an optimal antipodal spherical code whose vectors form a spherical -design, where
[TABLE]
Furthermore, [1] showed that is a spherical -design, using the special properties of the lattice. However, this fact is an example that extends to a more general setting as follows. The spherical -design obtained by Bondarenko in [1] is a special case of our main result, which is presented as the following theorem.
Theorem 1.1**.**
Let be a finite subset of sphere satisfying the condition (3). We set . Then is a spherical -design in .
We denote by the set defined in Theorem 1.1.
Corollary 1.1**.**
Let be a spherical -design in . Then is a spherical -design in . 2. 2.
Let be a spherical -design in and an antipodal set. Let be an arbitrary subset of with such that no pair of antipodal vectors is present in . Then is a spherical -design in .
In section 2, we give a proof of Theorem 1.1. In section 3, we give some examples.
2 Proof of Theorem 1.1
Now, we give the proof of Theorem 1.1.
Proof of Theorem 1.1.
Let be in and be in . By Proposition 1.1, we have
[TABLE]
since is a spherical -design. We have the following Gegenbauer polynomial of degree on :
[TABLE]
It is enough to show that
[TABLE]
since
[TABLE]
and is an antipodal set. We remark that if is a spherical -design, then is also a spherical -design.
In fact,
[TABLE]
Therefore, if is a spherical -design, then is a spherical -design.
∎
3 Examples
In this section, we give some examples of using Theorem 1.1.
First we recall the concept of a strongly perfect and spherical code.
Definition 3.1** ([6]).**
A lattice is called strongly perfect if the minimum vectors of form a spherical -design.
Definition 3.2** ([2]).**
An antipodal set in is called an antipodal spherical code if for some and all , , are not antipodal.
Next we give some examples.
Example 3.1**.**
The strongly perfect lattices whose ranks are less than have been classified [4, 5]. Such lattices whose ranks are greater than are as follows:
[TABLE]
(For a detailed explanation, see [4, 5].) Let be one of the above lattices and be the minimum vectors of . Then, let be an arbitrary subset of with such that no pair of antipodal vectors is present in .
By Corollary 1.1, is a spherical -design in , where is as follows:
[TABLE]
Example 3.2**.**
Let be the minimum vectors of the Barnes–Wall lattice of rank , and let be an arbitrary subset of with such that no pair of antipodal vectors is present in . We remark that is a spherical -design.
By Corollary 1.1, is a spherical -design in , where is as follows:
[TABLE]
Example 3.3**.**
Let be the minimum vectors of the Leech lattice, and let be an arbitrary subset of with such that no pair of antipodal vectors is present in . We remark that is a spherical -design.
By Corollary 1.1, is a spherical -design in , where is as follows:
[TABLE]
Acknowledgments
This work was supported by JSPS KAKENHI (18K03217).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A.V. Bondarenko, On a spherical code in the space of spherical harmonics, Ukrainian Math. J. 62 (2010), no. 6, 993–996.
- 2[2] J.H. Conway, N.J.A. Sloane, Sphere Packings Lattices and Groups , third edition, Springer, New York, 1999.
- 3[3] P. Delsarte, J.-M. Goethals, and J.J. Seidel, Spherical codes and designs, Geom. Dedicata 6 (1977), 363–388.
- 4[4] G. Nebe, B. Venkov, The strongly perfect lattices of dimension 10. Colloque International de Theorie des Nombres (Talence, 1999), J. Theor. Nombres Bordeaux 12 (2000), no. 2, 503–518.
- 5[5] G. Nebe, B. Venkov, Low-dimensional strongly perfect lattices. I. The 12-dimensional case, Enseign. Math. (2) 51 (2005), no. 1–2, 129–163.
- 6[6] B. Venkov, Réseaux et designs sphériques. (French) [Lattices and spherical designs] , Réseaux euclidiens, designs sphériques et formes modulaires, 10–86, Monogr. Enseign. Math., 37, Enseignement Math., Geneva, 2001.
