Upper bounds on the smallest size of a saturating set in a projective plane and the Birthday problem

Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco

Published 2015-05-06Version 1

The following upper bound on the smallest size $s(2,q)$ of a saturating set in a projective plane $\Pi _{q}$ (not necessary Desarguesian) of order $q$ is proven. \begin{equation*} s(2,q)\leq 2\sqrt{(q+1)\ln q}+2\thicksim 2\sqrt{q\ln q}. \end{equation*} Our approach is probabilistic rather than geometric. The proof uses some known results on the classical Birthday problem, and also provides the following result. In $\Pi _{q}$ any point $k$-set, with $ k\leq 2c\sqrt{(q+1)\ln q}+2$ and an universal constant $c\geq 1,$ is a saturating set with probability \begin{equation*} p>1-\frac{1}{q^{2c^{2}-2}}. \end{equation*}