Partial covers of \(\mathrm{PG}(n, q)\) (Q992790)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Partial covers of \(\mathrm{PG}(n, q)\)
scientific article

    Statements

    Partial covers of \(\mathrm{PG}(n, q)\) (English)
    0 references
    0 references
    0 references
    0 references
    10 September 2010
    0 references
    Let \(\mathcal C\) be a family of hyperplanes of \(\mathrm{PG}(n,q)\) and denote by \(\mathcal C(P)\) the set of hyperplanes of \(\mathcal C\) containing the point \(P\) of \(\mathrm{PG}(n,q)\). A \textit{\((q+a)\)-cover} of \(\mathrm{PG}(n,q)\) is a family \(\mathcal C\) of \(q+a\) different hyperplanes of \(\mathrm{PG}(n,q)\) with \(|\mathcal C(P)|\ge 1\) for all points \(P\) of \(\mathrm{PG}(n,q)\). A \textit{partial} \((q+a)\)-cover \(\mathcal S\) is a set of \(q+a\) different hyperplanes of \(\mathrm{PG}(n,q)\) such that there is at least one point \(Q\) of \(\mathrm{PG}(n,q)\) with \(|{\mathcal S}(Q)|=0\). A point \(H\) for which \(|\mathcal S(H)|=0\) holds, is called a \textit{hole} of \(\mathcal S\). A cover of \(\mathrm{PG}(n,q)\) is a dual blocking set. Using results of \textit{A. Blokhuis, A. E. Brouwer} and \textit{T. Szönyi} [J. Algebr. Comb. 32, No.~1, 59--66 (2010; Zbl 1204.51014)] and of others, the authors prove the following main theorem: If \({\mathcal S}\) is a partial \((q+a)\)-cover of \(\mathrm{PG}(n,q)\), \(a<(q-2)/3\), with at most \(q^{n-1}\) holes, then there are at least \(q^{n-1}-aq^{n-2}\) holes and the holes are contained in one hyperplane. If \(q\) is a prime, then \(\mathcal S\) consists of \(q\) hyperplanes through a common \((n-2)\)-space \(\pi\) and \(a\) other hyperplanes not through \(\pi\).
    0 references
    \((q+a)\)-cover
    0 references
    partial \((q+a)\)-cover
    0 references
    hole of a partial \((q+a)\)-cover
    0 references
    blocking set
    0 references
    tangent hyperplane to a blocking set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references