A New Lower Bound for the Size of an Affine Blocking Set

  • Maarten De Boeck
  • Geertrui Van de Voorde
DOI: https://doi.org/10.37236/7827
Keywords: Blocking set, Affine blocking set

Abstract

A blocking set in an affine plane is a set of points $B$ such that every line contains at least one point of $B$. The best known lower bound for blocking sets in arbitrary (non-desarguesian) affine planes was derived in the 1980's by Bruen and Silverman. In this note, we improve on this result by showing that a blocking set of an affine plane of order $q$, $q\geqslant 25$, contains at least $q+\lfloor\sqrt{q}\rfloor+3$ points.
Published
2018-11-30
How to Cite
De Boeck, M., & Van de Voorde, G. (2018). A New Lower Bound for the Size of an Affine Blocking Set. The Electronic Journal of Combinatorics, 25(4), P4.40. https://doi.org/10.37236/7827
Issue
Volume 25, Issue 4 (2018)
Article Number
P4.40