On designs in compact metric spaces and a universal bound on their size

DOI10.1016/S0012-365X(98)00074-0zbMath0959.05022MaRDI QIDQ1584452

R. Smith

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

orthogonal polynomialsassociation schemesmetric spacessubstitution function

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Other designs, configurations (05B30) Other finite incidence structures (geometric aspects) (51E30)

Related Items

Trace optimality of SIC POVMs, Equioverlapping measurements, Nikolskii constants for polynomials on the unit sphere, Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities, Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements, Phaseless signal recovery in infinite dimensional spaces using structured modulations, Complex Spherical Designs and Codes, Exact point-distributions over the complex sphere, Bounds for codes and designs in complex subspaces, Estimates of the asymptotic Nikolskii constants for spherical polynomials, Lower bounds for projective designs, cubature formulas and related isometric embeddings, Unitary designs and codes, A survey on spherical designs and algebraic combinatorics on spheres, Painless reconstruction from magnitudes of frame coefficients, An extremum problem for polynomials related to codes and designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• t-designs in projective spaces
• On tight t-designs in compact symmetric spaces of rank one
• Averaging sets: A generalization of mean values and spherical designs
• t-designs in classical association schemes
• Fisher type inequalities for Euclidean t-designs
• Designs as maximum codes in polynomial metric spaces
• On t-designs
• Spherical codes and designs
• Discrete quadrature and bounds on t-designs
• Isometric embeddings and geometric designs
• Polynomial spaces
• Positive definite functions on spheres
• Extending the t-Design Concept
• Some q-Krawtchouk Polynomials on Chevalley Groups
• Simple Constructions of Almost k-wise Independent Random Variables
• Bounds for quaternionic line systems and reflection groups.
• Lower bounds for spherical designs
• Codes Which Detect Deception
• The Addition Formula for Jacobi Polynomials and Spherical Harmonics
• On the distribution of points in a cube and the approximate evaluation of integrals