A new lower bound for the size of an affine blocking set

2018/04/25 by De Boeck, Maarten, Van de Voorde, Geertrui
#51E21 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1804.09511

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≥ 25, contains at least q+\lfloor√(q)\rfloor+3 points.

Related

• On Blocking Sets of Affine Spaces
• Generalizing blocking semiovals in finite projective planes
• Blocking Sets in the complement of hyperplane arrangements in projective space
• On the minimum blocking semioval in PG(2,11)
• Blocking Planes by Lines in PG(n,q)