Arcs and blocking sets. II (Q1099408)

[For part I see Lond. Math. Soc. Lect. Note Ser. 49, 52-60 (1981; Zbl 0472.51006)]. This paper was written in 1981. In the meantime its central result has been published by \textit{A. Blokhuis} and \textit{A. E. Brouwer} [Bull. London Math. Soc. 18, 132-134 (1986; Zbl 0563.05016)]. This states that, in \(PG(2,q)\) with q a non-square, a blocking set S has at least \(q+1+\sqrt{2q}\) elements. This contrasts with the case of q square in which the minimum number is actually \(q+\sqrt{q}+1\). A fundamental lemma for the proof is unfortunately misprinted: if S is minimal, \(| S| =q+\lambda\) and some line contains exactly \(\lambda-\theta\) points of S with \(\theta\geq 1\), then \(\lambda \geq (q+1+2\theta)(\theta +1)^{-1}.\)