Abstract
This article first of all discusses the problem of the cardinality of maximal partial spreads in PG(3,q), q square, q>4. Let r be an integer such that 2r≤q+1 and such that every blocking set of PG(2,q) with at most q+r points contains a Baer subplane. If S is a maximal partial spread of PG(3,q) with q 2-1-r lines, then r=s(\(\sqrt q\)+1) for an integer s≥2 and the set of points of PG(3,q) not covered byS is the disjoint union of s Baer subgeometriesPG(3,\(\sqrt q\)). We also discuss maximal partial spreads in PG(3,p 3), p=p h0 , p 0 prime, p 0 ≥ 5, h ≥ 1, p ≠ 5. We show that if p is non-square, then the minimal possible deficiency of such a spread is equal to p 2+p+1, and that if such a maximal partial spread exists, then the set of points of PG(3,p 3) not covered by the lines of the spread is a projected subgeometryPG(5,p) in PG(3,p 3). In PG(3,p 3),p square, for maximal partial spreads of deficiency δ ≤ p 2+p+1, the combined results from the preceding two cases occur. In the final section, we discuss t-spreads in PG(2t+1,q), q square or q a non-square cube power. In the former case, we show that for small deficiencies δ, the set of holes is a disjoint union of subgeometries PG(2t+1,\(\sqrt q\)), which implies that δ ≡ 0 (mod\(\sqrt q\)+1) and, when (2t+1)(\(\sqrt q\)-1) <q-1, that δ ≥ 2(\(\sqrt q\)+1). In the latter case, the set of holes is the disjoint union of projected subgeometries PG(3t+2,\(\sqrt[3]{q}\)) and this implies δ ≡ 0 (mod q 2/3+q 1/3+1). A more general result is also presented.
Similar content being viewed by others
References
A. Blokhuis and K. Metsch, On the size of a maximal partial spread, Des. Codes Cryptogr., Vol. 3 (1993) pp. 187-191.
A. Blokhuis, On the size of a blocking set in P G(2, p), Combinatorica, Vol. 14 (1994) pp. 111-114.
A. Blokhuis, S. M. Ball, A. Brouwer, L. Storme and T. Szőnyi, On the number of slopes of the graph of a function defined over a finite field, J. Combin. Theory, Ser. A, to appear.
A. Blokhuis, L. Storme and T. Szőnyi, Lacunary polynomials, multiple blocking sets and Baer subplanes, J. London Math. Soc., to appear.
A. A. Bruen, Baer subplanes and blocking sets, Bull. Amer. Math. Soc., Vol. 76 (1970) pp. 342-344.
A. A. Bruen, Partial spreads and replaceable nets, Canad. J. Math., Vol. 23 (1971) pp. 381-391.
A. A. Bruen, Blocking sets and skew subspaces of projective space, Canad. J. Math., Vol. 32 (1980) pp. 628-630.
D. Jungnickel, Maximal partial spreads and translation nets of small deficiency, J. Algebra, Vol. 90 (1984) pp. 119-132.
D. Jungnickel, Maximal partial spreads and transversal-free translation nets, J. Combin. Theory, Ser. A, Vol. 62 (1993) pp. 66-92.
G. Lunardon, P. Polito and O. Polverino, A geometric characterisation of linear k-blocking sets (Preprint).
K. Metsch, Improvement of Bruck's completion theorem, Des. Codes Cryptogr., Vol. 1 (1991) pp. 99-116.
O. Polverino, Small blocking sets in P G(2, p 3), Des. Codes Cryptogr., submitted.
O. Polverino and L. Storme, Minimal blocking sets in P G(2, p 3), (Preprint).
M. Sved, On configurations of Baer subplanes of the projective plane over a finite field of square order, Combinatorial Mathematics IX (Brisbane 1981), Lecture Notes in Math., Springer, Berlin-New York, Vol. 952 (1982) pp. 423-443,.
T. Szőnyi, Blocking sets in Desarguesian affine and projective planes, Finite Fields Appl., Vol. 3 (1997) pp. 187-202.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Metsch, K., Storme, L. Partial t-Spreads in PG(2t+1,q). Designs, Codes and Cryptography 18, 199–216 (1999). https://doi.org/10.1023/A:1008305824113
Issue Date:
DOI: https://doi.org/10.1023/A:1008305824113