English

Double blocking sets of size $3q-1$ in $\mathrm{PG}(2,q)$

Combinatorics 2019-02-20 v2

Abstract

The main purpose of this paper is to find double blocking sets in PG(2,q)\mathrm{PG}(2,q) of size less than 3q3q, in particular when qq is prime. To this end, we study double blocking sets in PG(2,q)\mathrm{PG}(2,q) of size 3q13q-1 admitting at least two (q1)(q-1)-secants. We derive some structural properties of these and show that they cannot have three (q1)(q-1)-secants. This yields that one cannot remove six points from a triangle, a double blocking set of size 3q3q, 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 3q13q-1 in PG(2,q)\mathrm{PG}(2,q) for q=13q=13, 1616, 1919, 2525, 2727, 3131, 3737 and 4343. If q>13q>13 is a prime, these are the first examples of double blocking sets of size less than 3q3q. 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

R2 v1 2026-06-23T01:43:58.325Z