paper

On upper bounds on the smallest size of a saturating set in a projective plane

arXiv:1505.01426

Abstract

In a projective plane (not necessarily Desarguesian) of order a point subset is saturating (or dense) if any point of is collinear with two points in. Using probabilistic methods, the following upper bound on the smallest size of a saturating set in is proved: \begin{equation*} s(2,q)\leq 2\sqrt{(q+1)\ln (q+1)}+2\thicksim 2\sqrt{q\ln q}. \end{equation*} We also show that for any constant a random point set of size in with is a saturating set with probability greater than Our probabilistic approach is also applied to multiple saturating sets. A point set is -saturating if for every point of the number of secants of through is at least , counted with multiplicity. The multiplicity of a secant is computed as The following upper bound on the smallest size of a -saturating set in is proved: \begin{equation*} s_{μ}(2,q)\leq 2(μ+1)\sqrt{(q+1)\ln (q+1)}+2\thicksim 2(μ+1)\sqrt{ q\ln q}\,\text{ for }\,2\leq μ\leq \sqrt{q}. \end{equation*} By using inductive constructions, upper bounds on the smallest size of a saturating set (as well as on a -saturating set) in the projective space are obtained. All the results are also stated in terms of linear covering codes.

15 pages, 24 references, misprints are corrected, Sections 3-5 and some references are added

Cited by in corpus (2)