No label defined (Q3838752)

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].