Discrete quadrature and bounds on t-designs

DOI10.1307/mmj/1029002165zbMath0407.05021OpenAlexW2041063028MaRDI QIDQ1257899

Charles F. Dunkl

Publication date: 1979

Published in: Michigan Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1307/mmj/1029002165

zbMATH Keywords

DesignsDiscrete Subset of RFisher's InequalityPositive Functional

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Other designs, configurations (05B30) Approximate quadratures (41A55)

Related Items (11)

Extremal polynomials for obtaining bounds for spherical codes and designs ⋮ On lower bounds on the size of designs in compact symmetric spaces of rank 1 ⋮ Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements ⋮ Designs as maximum codes in polynomial metric spaces ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Polynomial spaces ⋮ Lower bounds for projective designs, cubature formulas and related isometric embeddings ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications ⋮ On designs in compact metric spaces and a universal bound on their size ⋮ On tight t-designs in compact symmetric spaces of rank one

This page was built for publication: Discrete quadrature and bounds on t-designs