论文信息 - Partial covers of PG(n, q)

Partial covers of PG(n, q)

In this paper, we show that a set of q+a hyperplanes, q>13, a@?(q-10)/4, that does not cover PG(n,q), does not cover at least q^n^-^1-aq^n^-^2 points, and show that this lower bound is sharp. If the number of non-covered points is at most q^n^-^1, then we show that all non-covered points are contained in one hyperplane. Finally, using a recent result of Blokhuis, Brouwer and Szonyi [8], we remark that the bound on a for which these results are valid can be improved to a<(q-2)/3 and that this upper bound on a is sharp.

Geertrui Van de Voorde | Leo Storme | Stefan M. Dodunekov

[1] Aart Blokhuis,et al. On the size of a blocking set inPG(2,p) , 1994, Comb..

[2] Tamás Szonyi,et al. Small Blocking Sets in Higher Dimensions , 2001, J. Comb. Theory, Ser. A.

[3] R. C. Bose,et al. The construction of translation planes from projective spaces , 1964 .

[4] A. Blokhuis,et al. Covering all points except one , 2010 .

[5] Aiden A. Bruen. Blocking sets and skew subspaces of projective space , 1980 .

[6] Andries E. Brouwer,et al. Blocking sets in desarguesian projective planes , 1986 .

[7] T. Szonyi. Blocking Sets in Desarguesian Affine and Projective Planes , 1997 .

[8] Michel Lavrauw,et al. On the code generated by the incidence matrix of points and k-spaces in PG(n, q) and its dual , 2008, Finite Fields Their Appl..