The non-existence of certain large minimal blocking sets

From MaRDI portal





Let \(\pi_q\) be a projective plane of order \(q\). A minimal blocking \(k\)-set of \(\pi_q\) is a set \(K\) of points such that every line meets \(K\), no line is contained in \(K\), and for every point \(P\in K\) there is a line \(\ell\) such that \(\ell\cap K=\{P\}\). It is well-known that (a) \(q+\sqrt q+1\leq k\leq q\sqrt q+1\), (b) \(k=q+\sqrt q+1\) if and only if \(q\) is a square and \(K\) is a Baer subplane, (c) \(k=q\sqrt q+1\) if and only if \(q\) is a square and \(K\) is a unital. The question arises of what are the integers \(k\), \(q+\sqrt q+1< k< q\sqrt q+1\), such that a \(k\)-blocking set in \(\pi_q\) exists -- such values form the so-called spectrum of \(\pi_q\). Then it could be interesting to decide whether in particular the integers \(k\), near \(1+q\sqrt q\), belong to the spectrum. \textit{A. Blokhuis} and \textit{K. Metsch} [Lond. Math. Soc. Lect. Note Ser. 191, 37-52 (1993; Zbl 0797.51012)] give a negative answer for \(q\geq 25\), \(q\) a square, \(k=q\sqrt q\). The author extends this result to \(q=9\). To this end, he considers the number \(t_i\) of lines that intersect \(K\) in exactly \(i\) points (\(i=1,2,\ldots,9\)). Such integers satisfy three well-known simultaneous equations. Then he finds 19 arithmetically possible cases for the tuple \((t_1,t_2,\ldots,t_9)\) and obtains a contradiction in every single case.











This page was built for publication: The non-existence of certain large minimal blocking sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223756)