A new Euclidean tight 6-design

We give a new example of Euclidean tight 6-design in $\mathbb R^{22}$.Comment: 9 page

Cubature formulas, geometrical designs, reproducing kernels, and Markov operators

Cubature formulas and geometrical designs are described in terms of reproducing kernels for Hilbert spaces of functions on the one hand, and Markov operators associated to orthogonal group representations on the other hand. In this way, several known results for spheres in Euclidean spaces, involving cubature formulas for polynomial functions and spherical designs, are shown to generalize to large classes of finite measure spaces $(\Omega,\sigma)$ and appropriate spaces of functions inside $L^2(\Omega,\sigma)$. The last section points out how spherical designs are related to a class of reflection groups which are (in general dense) subgroups of orthogonal groups

Note on cubature formulae and designs obtained from group orbits

In 1960, Sobolev proved that for a finite reflection group G, a G-invariant cubature formula is of degree t if and only if it is exact for all G-invariant polynomials of degree at most t. In this paper, we find some observations on invariant cubature formulas and Euclidean designs in connection with the Sobolev theorem. First, we give an alternative proof of theorems by Xu (1998) on necessary and sufficient conditions for the existence of cubature formulas with some strong symmetry. The new proof is shorter and simpler compared to the original one by Xu, and moreover gives a general interpretation of the analytically-written conditions of Xu's theorems. Second, we extend a theorem by Neumaier and Seidel (1988) on Euclidean designs to invariant Euclidean designs, and thereby classify tight Euclidean designs obtained from unions of the orbits of the corner vectors. This result generalizes a theorem of Bajnok (2007) which classifies tight Euclidean designs invariant under the Weyl group of type B to other finite reflection groups.Comment: 18 pages, no figur

Complex spherical codes with three inner products

Let $X$ be a finite set in a complex sphere of $d$ dimension. Let $D(X)$ be the set of usual inner products of two distinct vectors in $X$. A set $X$ is called a complex spherical $s$-code if the cardinality of $D(X)$ is $s$ and $D(X)$ contains an imaginary number. We would like to classify the largest possible $s$-codes for given dimension $d$. In this paper, we consider the problem for the case $s=3$. Roy and Suda (2014) gave a certain upper bound for the cardinalities of $3$-codes. A $3$-code $X$ is said to be tight if $X$ attains the bound. We show that there exists no tight $3$-code except for dimensions $1$, $2$. Moreover we make an algorithm to classify the largest $3$-codes by considering representations of oriented graphs. By this algorithm, the largest $3$-codes are classified for dimensions $1$, $2$, $3$ with a current computer.Comment: 26 pages, no figur