On Euclidean Designs and Potential Energy
Tsuyoshi Miezaki, Makoto Tagami · The Electronic Journal of Combinatorics · 2012
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2012
Abstract
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 concept of strong Euclidean designs from the viewpoint of the linear programming bound, and we give a Fisher type inequality for strong Euclidean designs. A finite set on Euclidean space is called a Euclidean $a$-code if any distinct two points in the set are separated at least by $a$. As a corollary of the linear programming bound, we give a method to determine an upper bound on the cardinalities of Euclidean $a$-codes on concentric spheres of given radii.
Similarly we also give a method to determine a lower bound on the cardinalities of Euclidean $t$-designs as an analogue of the linear programming bound.
Open the resolved locator · 10.37236/8
Metadata licence: OpenAlex metadata (CC0)