Related papers: On Euclidean $t$-designs
The hyperoctahedral group $H$ in $n$ dimensions (the Weyl group of Lie type $B_n$) is the subgroup of the orthogonal group generated by all transpositions of coordinates and reflections with respect to coordinate hyperplanes. A finite set…
A finite set $X \seq \RR^n$ with a weight function $w : X \longrightarrow \RR_{>0}$ is called \emph{Euclidean $t$-design} in $\RR^n$ (supported by $p$ concentric spheres) if the following condition holds: \[ \sum_{i=1}^p…
A weighted $t$-design in $\mathbb{R}^d$ is a finite weighted set that exactly integrates all polynomials of degree at most $t$ with respect to a given probability measure. A fundamental problem is to construct weighted $t$-designs with as…
The concept of spherical $t$-design, which is a finite subset of the unit sphere, was introduced by Delsarte-Goethals-Seidel (1977). The concept of Euclidean $t$-design, which is a two step generalization of spherical design in the sense…
This paper studies numerical integration over the unit sphere $ \mathbb{S}^2 \subset \mathbb{R}^{3} $ by using spherical $t$-design, which is an equal positive weights quadrature rule with polynomial precision $t$. We investigate two kinds…
A set ${X}_{N}=\{x_1,\ldots,x_N\}$ of $N$ points on the unit sphere $\mathbb{S}^d,\,d\geq 2$ is a spherical $t$-design if the average of any polynomial of degree at most $t$ over the sphere is equal to the average value of the polynomial…
Motivated by the similarities between the theory of spherical $t$-designs and that of $t$-designs in $Q$-polynomial association schemes, we study two versions of relative $t$-designs, the counterparts of Euclidean $t$-designs for $P$-…
A spherical $t$-design is a set of points on the sphere that are nodes of a positive equal weight quadrature rule having algebraic accuracy $t$ for all spherical polynomials with degrees $\le t$. Spherical $t$-designs have many…
Relative $t$-designs in the $n$-dimensional hypercube $\mathcal{Q}_n$ are equivalent to weighted regular $t$-wise balanced designs, which generalize combinatorial $t$-$(n,k,\lambda)$ designs by allowing multiple block sizes as well as…
A spherical $t$-design is a finite subset $X$ of the unit sphere such that every polynomial of degree at most $t$ has the same average over $X$ as it does over the entire sphere. Determining the minimum possible size of spherical designs,…
We generalize the famous weight basis constructions of the finite-dimensional irreducible representations of $\mathfrak{sl}(n,\mathbb{C})$ obtained by Gelfand and Tsetlin in 1950. Using combinatorial methods, we construct one such basis for…
We study Euclidean designs from the viewpoint of the potential energy. For a finite set in Euclidean space, We formulate a linear programming bound for the potential energy by applying harmonic analysis on a sphere. We also introduce the…
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…
A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find…
This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…
A $t\text{-}(n,K,\lambda;q)$ design, also called the $q$-analog of a $t$-wise balanced design, is a set ${\mathcal B}$ of subspaces with dimensions contained in $K$ of the $n$-dimensional vector space ${\mathbb F}_q^n$ over the finite field…
It is known that there is a close analogy between "Euclidean t-designs vs. spherical t-designs" and "Relative t-designs in binary Hamming association schemes vs. combinatorial t-designs". In this paper, we want to prove how much we can…
Usually a Riemannian geometry is considered to be the most general geometry, which could be used as a space-time geometry. In fact, any Riemannian geometry is a result of some deformation of the Euclidean geometry. Class of these Riemannian…
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…
We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…