Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

More on the corner-vector construction for spherical designs

Kenji Tanino, Tomoki Tamaru, Masatake Hirao, Masanori Sawa

TL;DR

The paper generalizes the classical corner-vector construction to a broad class of weighted spherical designs built from $B_n$-orbits of generalized corner vectors, establishing a uniform upper bound $t\le 15$ on the design degree for $n\ge 4$ using a hybrid argument that combines cross-ratio analysis, Xu’s simplex correspondence, and Hilbert-identity techniques. It provides detailed characterizations and finite classifications for designs with one or two proper orbits, including notable $7$-designs and $9$-designs, and constructs higher-orbit examples (up to $11$ and $13$-designs on $ S^3$) while posing open questions about larger-degree designs. Throughout, the work highlights algebraic–geometric methods (polynomial invariants, Gröbner bases) and reveals deep connections to lattice theory, including shells of the Barnes–Wall and Leech lattices, suggesting lattice–design–code correspondences. These results advance constructive design theory in higher dimensions and link combinatorial designs to explicit lattice constructions with potential numerical and coding applications.

Abstract

This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the {\it generalized corner-vector method}. First we establish a uniform upper bound for the degree of designs obtained from the proposed method. Our proof is a hybrid argument that employs techniques in analysis and combinatorics, especially a famous result by Xu(1998) on the interrelation between spherical designs and simplical designs, and the cross-ratio comparison method for Hilbert identities introduced by Nozaki and Sawa(2013). We extensively study conditions for the existence of designs obtained from our method, and present many curious examples of degree $7$ through $13$, some of which are, to our surprise, characterized in terms of integral lattices.

More on the corner-vector construction for spherical designs

TL;DR

The paper generalizes the classical corner-vector construction to a broad class of weighted spherical designs built from -orbits of generalized corner vectors, establishing a uniform upper bound on the design degree for using a hybrid argument that combines cross-ratio analysis, Xu’s simplex correspondence, and Hilbert-identity techniques. It provides detailed characterizations and finite classifications for designs with one or two proper orbits, including notable -designs and -designs, and constructs higher-orbit examples (up to and -designs on ) while posing open questions about larger-degree designs. Throughout, the work highlights algebraic–geometric methods (polynomial invariants, Gröbner bases) and reveals deep connections to lattice theory, including shells of the Barnes–Wall and Leech lattices, suggesting lattice–design–code correspondences. These results advance constructive design theory in higher dimensions and link combinatorial designs to explicit lattice constructions with potential numerical and coding applications.

Abstract

This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the {\it generalized corner-vector method}. First we establish a uniform upper bound for the degree of designs obtained from the proposed method. Our proof is a hybrid argument that employs techniques in analysis and combinatorics, especially a famous result by Xu(1998) on the interrelation between spherical designs and simplical designs, and the cross-ratio comparison method for Hilbert identities introduced by Nozaki and Sawa(2013). We extensively study conditions for the existence of designs obtained from our method, and present many curious examples of degree through , some of which are, to our surprise, characterized in terms of integral lattices.
Paper Structure (16 sections, 26 theorems, 127 equations, 3 figures, 3 tables)

This paper contains 16 sections, 26 theorems, 127 equations, 3 figures, 3 tables.

Table of Contents

  1. Introduction
  2. Preliminary
  3. Polynomial space
  4. Spherical design, Hilbert identity, simplicial design
  5. The corner-vector method
  6. A uniform upper bound for the degree of our designs
  7. Uniform bound
  8. Proof of Theorem \ref{['thm:main_bound']}
  9. Designs with a single proper orbit
  10. Designs with two proper orbits
  11. Characterization of $7$-designs
  12. Characterization of $9$-designs
  13. Proofs of Theorems \ref{['thm:main1']} and \ref{['thm:main3']}
  14. Designs with more than two proper orbits on $\mathbb{S}^3$
  15. Conclusion and further remarks
  16. ...and 1 more sections

Key Result

Proposition 2.1

It holds that Moreover (eq:harm_decomp) is the orthogonal direct sum with respect to the inner product $(\phi,\psi) = \frac{1}{|\mathbb{S}^{n-1}|} \int_{\mathbb{S}^{n-1}} \phi \psi d\rho$.

Figures (3)

  • Figure 1: $\psi(v_{a, s}^{B_3}) \; (s = 0, 1, 2)$
  • Figure 2: $v_{a_1, 1}^{B_3}$(left), $v_{a_2, 2}^{B_3}$(middle), $v_{a_1, 1}^{B_3} \cup v_{a_2, 2}^{B_3}$(right)
  • Figure 3: $v_{a_1, 2}^{B_3}$(left), $v_{a_2, 2}^{B_3}$(middle), $v_{a_1, 2}^{B_3} \cup v_{a_2, 2}^{B_3}$(right)

Theorems & Definitions (62)

  • Proposition 2.1: cf. DGS1977M1966
  • Definition 2.2: Spherical cubature and design
  • Example 2.3: cf. BB2009DGS1977
  • Example 2.4
  • Example 2.5: Schur's formula
  • Definition 2.6
  • Theorem 2.7: Lyubich-Vaserstein theorem
  • Example 2.8: Schur's identity
  • Theorem 2.9: X1998
  • Example 2.10: Example \ref{['ex:spherical_dim3']}, revisited
  • ...and 52 more