A new lower bound for the size of an affine blocking set (Q1630891)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new lower bound for the size of an affine blocking set |
scientific article |
Statements
A new lower bound for the size of an affine blocking set (English)
0 references
5 December 2018
0 references
Summary: 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 \textit{A. A. Bruen} and \textit{R. Silverman} [Eur. J. Comb. 8, 351--356 (1987; Zbl 0638.51013)]. In this note, we improve on this result by showing that a blocking set of an affine plane of order \(q\), \(q\geq 25\), contains at least \(q+\lfloor\sqrt{q}\rfloor+3\) points.
0 references
blocking set
0 references
affine blocking set
0 references
