scientific article; zbMATH DE number 1189051

MaRDI QIDQ3838752zbMATH OpenFDO

Authors Svetla Nikova

Publication date 28 October 1998

zbMATH Keywords

\(t\)-designscomplex projective space

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Review text

The integral of a polynomial over a complex projective space can be approximated by its average value at a finite subset of the space. If this approximation is exact for all polynomials of degree at most \(t\), the set is a \(t\)-design. The author applies linear programming techniques to obtain new lower bounds on the cardinality of \(t\)-designs in complex projective spaces. The previosly known improvements of the classical bound were by one only (in cases where the bounds were proved to be not tight). The author gives examples of new bounds for \(t=5,6,7\) and in some cases the improvements are nearly ten per cent. For the entire collection see [Zbl 0889.00043].

Recommendations

• On lower bounds on the size of designs in compact symmetric spaces of rank 1
• scientific article; zbMATH DE number 1505513
• Bounds for codes and designs in complex subspaces
• New lower bounds for some spherical designs
• Linear programming bounds for covering radius of spherical designs

Cited in

(3)

• Lower bounds for projective designs, cubature formulas and related isometric embeddings
• On lower bounds on the size of designs in compact symmetric spaces of rank 1
• scientific article; zbMATH DE number 1498794 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838752)