On Euclidean $t$-designs
B\'ela Bajnok

TL;DR
This paper studies Euclidean t-designs, providing recursive constructions to generate such designs in higher dimensions and constructing tight designs for specific parameters, advancing the understanding of their structure and existence.
Contribution
It introduces a recursive method to construct Euclidean t-designs in higher dimensions using Gauss-Jacobi quadrature, and explicitly constructs tight designs for certain parameters.
Findings
Recursive construction method for Euclidean t-designs in R^n.
Explicit construction of tight Euclidean designs for n=2 with all t and |R|.
Examples of tight designs for specific parameters in low dimensions.
Abstract
A Euclidean -design, as introduced by Neumaier and Seidel (1988), is a finite set with a weight function for which holds for every polynomial of total degree at most ; here is the set of norms of the points in , is the total weight of all elements of with norm , is the -dimensional sphere of radius centered at the origin, and is the average of over . Neumaier and Seidel (1988), as well as Delsarte and Seidel (1989), also proved a Fisher-type inequality (assuming that the design is antipodal if is odd). For fixed and we have . In Part I of this paper we provide a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Quasicrystal Structures and Properties · Optimization and Packing Problems
