English

On Euclidean $t$-designs

Combinatorics 2015-12-10 v1 Metric Geometry

Abstract

A Euclidean tt-design, as introduced by Neumaier and Seidel (1988), is a finite set XRn{\cal X} \subset \mathbb{R}^n with a weight function w:XR+w: {\cal X} \rightarrow \mathbb{R}^+ for which rRWrfSr=xXw(x)f(x)\sum_{r \in R} W_r \overline{f}_{S_{r}} = \sum_{{\bf x} \in {\cal X}} w({\bf x}) f({\bf x}) holds for every polynomial ff of total degree at most tt; here RR is the set of norms of the points in X{\cal X}, WrW_r is the total weight of all elements of X{\cal X} with norm rr, SrS_r is the nn-dimensional sphere of radius rr centered at the origin, and fSr\overline{f}_{S_{r}} is the average of ff over SrS_{r}. Neumaier and Seidel (1988), as well as Delsarte and Seidel (1989), also proved a Fisher-type inequality XN(n,R,t)|{\cal X}| \geq N(n,|R|,t) (assuming that the design is antipodal if tt is odd). For fixed nn and R|R| we have N(n,R,t)=O(tn1)N(n,|R|,t)=O(t^{n-1}). In Part I of this paper we provide a recursive construction for Euclidean tt-designs in Rn\mathbb{R}^n. Namely, we show how to use certain Gauss--Jacobi quadrature formulae to "lift" a Euclidean tt-design in Rn1\mathbb{R}^{n-1} to a Euclidean tt-design in Rn\mathbb{R}^{n}, preserving both the norm spectrum RR and the weight sum WrW_r for each rRr \in R. A Euclidean design with exactly N(n,R,t)N(n,|R|,t) points is called tight. In Part II of this paper we construct tight Euclidean designs for n=2n=2 and every tt and R|R| with Rt+54|R| \leq \frac{t+5}{4}. We also provide examples for tight Euclidean designs with (n,R,t){(3,2,5),(3,3,7),(4,2,7)}(n,|R|,t) \in \{(3,2,5),(3,3,7),(4,2,7)\}.

Keywords

Cite

@article{arxiv.1512.02981,
  title  = {On Euclidean $t$-designs},
  author = {Béla Bajnok},
  journal= {arXiv preprint arXiv:1512.02981},
  year   = {2015}
}
R2 v1 2026-06-22T12:05:34.297Z