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

Abstract

In a projective plane &#x03A0;<sub>q</sub> (not necessarily Desar-guesian) of order q, a point subset S is saturating (or dense) if any point of &#x03A0;<sub>q</sub>\S is collinear with two points in S. Using probabilistic methods, more general than those previously used for saturating sets, the following upper bound on the smallest size s(2, q) of a… (More)

Topics

Cite this paper

@article{Bartoli2016NewUB, title={New upper bounds on the smallest size of a saturating set in a projective plane}, author={Daniele Bartoli and Alexander A. Davydov and Massimo Giulietti and Stefano Marcugini and Fernanda Pambianco}, journal={2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)}, year={2016}, pages={18-22} }