A New Lower Bound for the Size of an Affine Blocking Set
A New Lower Bound for the Size of an Affine Blocking Set
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 …