On Euclidean t-designs

Abstract

A Euclidean t-design, as introduced by Neumaier and Seidel (1988), is a finite set X ⊂ Rn with a weight function w: X → R+ for which Σr ∈ R Wr fSr = Σ x ∈ X w( x) f( x) holds for every polynomial f of total degree at most t; here R is the set of norms of the points in X, Wr is the total weight of all elements of X with norm r, Sr is the n-dimensional sphere of radius r centered at the origin, and fSr is the average of f over Sr. Neumaier and Seidel (1988), as well as Delsarte and Seidel (1989), also proved a Fisher-type inequality | X| ≥ N(n,|R|,t) (assuming that the design is antipodal if t is odd). For fixed n and |R| we have N(n,|R|,t)=O(tn-1). In Part I of this paper we provide a recursive construction for Euclidean t-designs in Rn. Namely, we show how to use certain Gauss--Jacobi quadrature formulae to "lift" a Euclidean t-design in Rn-1 to a Euclidean t-design in Rn, preserving both the norm spectrum R and the weight sum Wr for each r ∈ R. A Euclidean design with exactly N(n,|R|,t) points is called tight. In Part II of this paper we construct tight Euclidean designs for n=2 and every t and |R| with |R| ≤ t+54. We also provide examples for tight Euclidean designs with (n,|R|,t) ∈ \(3,2,5),(3,3,7),(4,2,7)\.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…