Double blocking sets of size $3q-1$ in $\mathrm{PG}(2,q)$
Abstract
The main purpose of this paper is to find double blocking sets in of size less than , in particular when is prime. To this end, we study double blocking sets in of size admitting at least two -secants. We derive some structural properties of these and show that they cannot have three -secants. This yields that one cannot remove six points from a triangle, a double blocking set of size , and add five new points so that the resulting set is also a double blocking set. Furthermore, we give constructions of minimal double blocking sets of size in for , , , , , , and . If is a prime, these are the first examples of double blocking sets of size less than . These results resolve two conjectures of Raymond Hill from 1984.
Keywords
Cite
@article{arxiv.1805.01267,
title = {Double blocking sets of size $3q-1$ in $\mathrm{PG}(2,q)$},
author = {Bence Csajbók and Tamás Héger},
journal= {arXiv preprint arXiv:1805.01267},
year = {2019}
}
Comments
2 figures, revised version