More on the corner-vector construction for spherical designs

This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the 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 simplicial 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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>7</mml:mn> </mml:math> through <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>13</mml:mn> </mml:math> , some of which are, to our surprise, characterized in terms of integral lattices.