No label defined (Q4028535)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 140150
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 140150

      Statements

      0 references
      28 March 1993
      0 references
      Chebyshev-type quadrature formulas
      0 references
      sphere
      0 references
      \(t\)-design
      0 references
      spherical designs
      0 references
      tight spherical designs
      0 references
      upper bound
      0 references
      [For the entire collection see Zbl 0747.00036.] We are concerned with Chebyshev-type quadrature formulas on the \(d\)- sphere, i.e. formulas of the type \[ {1\over\sigma_ d(S^ d)}\int_{S^ d}f(x)d\sigma_ d(x)\approx{1\over| X|}\sum_{x\in X}f(x), \] where \(S^ d\) denotes the \(d\)-dimensional unit sphere in \(\mathbb{R}^{d+1}\), \(\sigma_ d\) denotes the surface measure on \(S^ d\), and \(X\) is a finite set on the sphere. The formula says that the average value of the function \(f(x)=f(x_ 0,x_ 1,\dots,x_ d)\) on the sphere is approximated by the arithmetic average of its values on the set \(X\). This concept is analogous to that of an interval averaging set, which has been extensively studied by Gauss, Chebyshev and later by Bernstein, Krylov, Gautschi and others. If the formula above is exact for all polynomials of degree at most \(t\), then \(X\) is called a \(t\)-design on \(S^ d\). The concept of spherical designs was introduced by \textit{P. Delsarte}, \textit{J. M. Goethals} and \textit{J. J. Seidel} in [(*) Geom. Dedicata 6, 363-388 (1977; Zbl 0376.05015)], and the existence for any \(t\), \(d\) and large enough \(N=| X|\) was proved by \textit{P. D. Seymour} and \textit{T. Zaslavsky} in [Adv. Math. 52, 213-240 (1984; Zbl 0596.05012)]. A construction for \(t=2\) (with arbitrary \(d\) and all possible values of \(N)\) was given by \textit{Y. Mimura} in 1988 and for \(t\leq 5\) (all \(d\) and large enough \(N)\) by this author in 1989. It is easy to see that the vertices of a regular \(N\)-gon with \(N\geq t+1\) give a spherical \(t\)-design for \(d=1\). (A \(t\)-design on the circle must have at least \(t+1\) points.) The present author gave a simple construction on the 2-sphere for arbitrary \(t\) and large enough \(N\), which he later generalized for arbitrary dimension. The number of nodes needed was then greatly reduced by the author and \textit{P. Rabau} in 1990. In the next section we will discuss this construction of spherical designs. Our construction will be recursive on \(d\), and will use averaging sets on the interval, with suitable chosen weight functions. In Section 3 we will address the problem of finding all integer triples \((t,d,N)\) for which spherical \(t\)-designs exist on \(S^ d\) on \(N\) nodes. There is a lower bound \(N_ d(t)\) given for the number of nodes by \textit{P. Delsarte}, \textit{J. M. Goethals} and \textit{J. J. Seidel} in (*). The spherical \((t,d,N)\)-design is called tight if \(N=N_ d(t)\). In 1980 \textit{E. Bannai} and \textit{R. M. Damerell} proved that tight spherical designs for \(d\geq 2\) exist only if \(t=1,2,3,4,5,7\) or 11. All tight spherical designs are known except for \(t=4,5\) and 7. Let \(M_ d(t)\) denote the minimum size of a spherical \(t\)-design on \(S^ d\), and let \(M_ d'(t)\) denote the smallest integer such that for any \(N\geq M_ d'(t)\), \(t\)- designs on \(S^ d\) exist on \(N\) nodes. These two values, although believed to be close, are not always equal. In this paper we will establish an upper bound for \(M_ d(t)\) and \(M_ d'(t)\).
      0 references

      Identifiers