On saturating sets in projective spaces. (Q1399903)

A point set \(S\) in the \(n\)-dimensional projective space \(\text{PG}(n, q)\) is \(\rho\)-saturating if \(\rho\) is the least integer such that for any point \(x\in\text{PG}(n, q)\) there exist \(\rho+ 1\) points in \(S\) generating a subspace of \(\text{PG}(n, q)\) in which \(x\) lie. Minimal saturating sets in projective spaces \(\text{PG}(n, q)\) are considered. Estimates and exact values of some extremal parameters are given. In particular, the greatest cardinality of a minimal 1-saturating set has been determined. A concept of saturating density is introduced. It allows to obtain new lower bounds for the smallest minimal saturating sets. A number of exhaustive results for small \(q\) are obtained. Many new small 1-saturating sets in \(\text{PG}(2, q)\), \(q\leq 587\), are constructed by computer. This well-written paper is an excellent example of computer aided search.