Note on the existence of large minimal blocking sets in galois planes
- 69 Downloads
A subsetS of a finite projective plane of orderq is called a blocking set ifS meets every line but contains no line. For the size of an inclusion-minimal blocking setq+\(\sqrt q \)+≤∣S∣≤q\(\sqrt q \)+1 holds (). Ifq is a square, then inPG(2,q) there are minimal blocking sets with cardinalityq\(\sqrt q \)+1. Ifq is not a square, then the various constructions known to the author yield minimal blocking sets with less than 3q points. In the present note we show that inPG(2,q),q≡1 (mod 4) there are minimal blocking sets having more thanqlog2q/2 points. The blocking sets constructed in this note contain the union ofk conics, wherek≤log2q/2. A slight modification of the construction works forq≡3 (mod 4) and gives the existence of minimal blocking sets of sizecqlog2q for some constantc.
As a by-product we construct minimal blocking sets of cardinalityq\(\sqrt q \)+1, i.e. unitals, in Galois planes of square order. Since these unitals can be obtained as the union of\(\sqrt q \) parabolas, they are not classical.
AMS subject classification code (1991)51 E 21
Unable to display preview. Download preview PDF.
- P. J. Cameron: Four Lectures on Projective Geometries, in:Finite Geometries (ed.: C.A. Baker, L.M. Batten), Lecture Notes in Pure and Applied Math.103, M. Dekker, New York, 1985, 27–63.Google Scholar
- H. Wilbrink: A characterization of classical unitals, in:Finite Geometries, Lecture Notes in Pure and Appl. Math.82, M. Dekker, New York, 1983, 445–454.Google Scholar