The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
type: Item
instance of: scholarly article
title: The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
zbMATH Open document ID: 1117.51011
author: Patrick Govaerts
author: Leo Storme
published in: Journal of Combinatorial Theory. Series A
publication date: 2006-12-07T00:00:00Z
review text: A blocking set with respect to \(t\)-spaces in an \(n\)-dimensional projective space is a set of points intersecting every \(t\)-dimensional subspace. It is called trivial if it contains an \((n-t)\)-dimensional subspace. The smallest non-trivial blocking sets with respect to \(t\)-spaces in finite desarguesian projective spaces \(PG(n,q)\) with \(q>2\) were characterized by \textit{A. Beutelspacher} [Geom. Dedicata 9, 425--449 (1980; Zbl 0377.50007)] as cones with vertex an \((n-t-2)\)-dimensional space \(\pi\) and base a non-trivial blocking set of minimal size in a plane skew to \(\pi\). In this paper, a similar result is obtained for the case \(q=2\), \(n\geq 3\), \(1\leq t\leq n-2\). It is proved that the smallest non-trivial blocking sets are cones with vertex an \((n-t-3)\)-space \(\pi\) and base the set of points on the edges of a tetrahedron in a solid skew to \(\pi\). The authors also show that the smallest non-trivial blocking sets with respect to hyperplanes in \(PG(n,2)\), \(n\geq 3\), are sets of \(5\) points in a \(3\)-dimensional space, no four of which are coplanar.
Mathematics Subject Classification ID: 51E21
zbMATH DE Number: 5078231
zbMATH Keywords: blocking sets
zbMATH Keywords: Galois spaces
MaRDI profile type: Publication
full work available at URL: j.jcta.2005.11.002
OpenAlex ID: W1998187090
cites work: Blocking sets and partial spreads in finite projective spaces
cites work: On the size of a blocking set in \(\text{PG}(2,p)\)
cites work: Q4878658
cites work: A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
cites work: Baer subplanes and blocking sets
cites work: Q4875399
cites work: Small minimal blocking sets and complete \(k\)-arcs in PG\((2,p^3)\)
cites work: Small blocking sets in \(PG(2,p^3)\)
cites work: Small minimal blocking sets in \(\text{PG}(2,q^3)\)
cites work: On small blocking sets and their linearity
DOI: 10.1016/J.JCTA.2005.11.002
Recommended article: Blocking sets in \(\mathrm{PG}(r,q^n)\)
Recommended article: Q2712125
Recommended article: Blocking Sets in Desarguesian Projective Planes
Recommended article: Q4875399
Recommended article: Small point sets of \(\text{PG}(n, q ^{3})\) intersecting each \(k\)-subspace in 1 mod \(q\) points
Recommended article: On multiple blocking sets in Galois planes
Recommended article: Q3825646
Recommended article: Lower bounds for the cardinality of minimal blocking sets in projective spaces
Recommended article: Q4878658
Recommended article: On the size of a blocking set in \(\text{PG}(2,p)\)
description: scientific article; zbMATH DE number 5078231