On lower bounds on the size of designs in compact symmetric spaces of rank 1

DOI10.1007/s000130050035zbMath0871.05010MaRDI QIDQ1359065

Svetla Nikova, P. G. Boyvalenkov

Publication date: 24 September 1997

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000130050035

zbMATH Keywords

linear programming; bounds; \(t\)-designs; compact symmetric spaces

Mathematics Subject Classification ID

05B30: Other designs, configurations

Related Items

A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs, Lower bounds for projective designs, cubature formulas and related isometric embeddings, A survey on spherical designs and algebraic combinatorics on spheres, Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements

Uses Software

• Cayley

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• t-designs in projective spaces
• Tight t-designs and squarefree integers
• On tight t-designs in compact symmetric spaces of rank one
• Averaging sets: A generalization of mean values and spherical designs
• Tight 4 and 5-designs in projective spaces
• Designs as maximum codes in polynomial metric spaces
• Spherical codes and designs
• Discrete quadrature and bounds on t-designs
• Extremal polynomials for obtaining bounds for spherical codes and designs
• Some constructions of spherical 5-designs
• Two-point homogeneous spaces