Results on maximal partial spreads in \(PG(3,p^3)\) and on related minihypers (Q1404319): Difference between revisions

Let \(S\) be a maximal partial spread of \(PG(3,q^3)\), where \(q\) is a power of a prime \(p\geq 7\). A hole of \(S\) is a point of \(PG(3,q^3)\) not covered by some line of \(S\), and a poor plane of \(S\) is a plane of \(PG(3,q^3)\) not containing a line of \(S\). In [\textit{K. Metsch} and \textit{L. Storme}, Des. Codes Cryptography 18, 199-216 (1999; Zbl 0964.51005)] it is shown that if the above maximal partial spread \(S\) has deficiency \(\delta \leq q^2 + q + 1\), then \(\delta = q^2 + q + 1\) and the set of holes is a projected subgeometry of \(PG(5,q)\) in \(PG(3,q^3)\), or \(\delta \equiv 0\) (mod \( q^{3\over 2} + 1\)) and the set of holes is the union of disjoint subgeometries \(PG(3,q^{3\over 2})\). Moreover, the latter case only occurs when \(q\) is an even power of \(p\). In the clever and well-written paper under review, by studying in detail the set of holes in poor planes, the authors are able to obtain a discrete spectrum for the deficiencies \(\delta\) of such maximal partial spreads. Minihypers and minimal blocking sets are extensively used.