On the spectrum of minimal blocking sets in PG(2,q)
A blocking set \(B\) in PG\((2,q)\) is a set of points intersecting every line in at least one point. A blocking set \(B\) is called trivial when it contains a line and it is called minimal when none of its proper subsets still is a blocking set. This article gives a survey on the spectrum of minimal non-trivial blocking sets in PG\((2,q)\). This is the problem of determining the integers \(k\) for which minimal blocking sets of size \(k\) in PG\((2,q)\) exist. The authors have collected the results according to the intervals: (1) \(k <3(q+1)/2\) corresponding to the sizes of small minimal blocking sets, (2) \(3(q+1)/2 \leq k \leq 2q-1\), (3) \(k>2q-1\), and (4) large values of \(k\). In the final subsection, minimal non-trivial blocking sets in planes of small order are discussed. Regarding the different cases, there is hope that small minimal non-trivial blocking sets can be characterized. Regarding (2), there seems to be some structure in the minimal non-trivial blocking sets of these sizes, particularly when \(k\) is only slightly larger than \(3(q+1)/2\). There are in case (3) many blocking sets of size between \(2q-1\) and \(3q-3\), but no examples of minimal non-trivial blocking sets of size \(cq\) are known, where \(c\) is a constant larger than 3. There are several constructions giving minimal blocking sets of size \(cq \log q\). Very few constructions give larger blocking sets; a new construction is presented in this article. In the second section, two general construction methods for minimal blocking sets are discussed. They can be used to construct blocking sets of cardinalities belonging to distinct intervals mentioned above.
- The spectrum of minimal blocking sets
- A spectrum result on minimal blocking sets with respect to the planes of \(\text{PG}(3, q)\), \(q\) odd
- Minimal blocking sets in finite planes
- On large minimal blocking sets in PG(2,q)
- On the number of pairwise non-isomorphic minimal blocking sets in \(\mathrm{PG}(2,q)\)
- On the number of pairwise non-isomorphic minimal blocking sets in \(\mathrm{PG}(2,q)\)
- Minimal blocking sets in PG\((2,q)\) arising from a generalized construction of Megyesi
- The spectrum of minimal blocking sets
- Unique reducibility of multiple blocking sets
- Power sum polynomials in a discrete tomography perspective
- Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\)
- Constructing permutations of finite fields via linear translators
- Blocking sets in \(\text{PG}(2,q^n)\) from cones of \(\text{PG}(2n,q)\)
- On the smallest maximal partial ovoids and spreads of the generalized quadrangles \(W(q)\) and \(Q(4,q)\)
- On the stability of Baer subplanes
- Threshold functions for incidence properties in finite vector spaces
- Large blocking sets in \(\mathrm{PG}(2,q^2)\)
- Blocking and double blocking sets in finite planes
- The use of blocking sets in Galois geometries and in related research areas
- Blocking sets in the complement of hyperplane arrangements in projective space
- On the stability of small blocking sets
- On large minimal blocking sets in PG(2,q)
- Blocking Sets of Index Three
- Spectrum results in Galois geometries
- Minimal Blocking Sets inPG(n, 2) and Covering Groups by Subgroups
- Perspective on complexity measures targeting read-once branching programs
- Linear sets in finite projective spaces
- Codes arising from incidence matrices of points and hyperplanes in \(\mathrm{PG}(n, q)\)
- A spectrum result on minimal blocking sets with respect to the planes of \(\text{PG}(3, q)\), \(q\) odd
This page was built for publication: On the spectrum of minimal blocking sets in \(\text{PG}(2,q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402886)
