Partial covers of PG(n, q)

DOI10.1016/J.EJC.2009.07.008zbMATH Open1201.51011arXiv1210.1002OpenAlexW2141812249MaRDI QIDQ992790FDOQ992790

Authors: Stefan Dodunekov, Leo Storme, Geertrui Van de Voorde 

Publication date: 10 September 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 [3], 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

Full work available at URL: https://arxiv.org/abs/1210.1002

Recommendations

• scientific article; zbMATH DE number 94596
• scientific article; zbMATH DE number 7666857
• On a particular class of minihypers and its applications. I: The result for general \(q\)
• Small blocking sets in higher dimensions
• Lower bounds for the cardinality of minimal blocking sets in projective spaces
• On the cardinality of blocking sets in PG(2,q)
• Arcs and blocking sets. II
• Nuclei of pointsets in \(PG(n,q)\)
• Blocking sets in finite projective spaces and uneven binary codes
• Small point sets of \(\text{PG}(n,p^{3h})\) intersecting each line in 1 mod \(p^{h}\) points

zbMATH Keywords

blocking set\((q+a)\)-coverhole of a partial \((q+a)\)-coverpartial \((q+a)\)-covertangent hyperplane to a blocking set

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Blocking sets, ovals, (k)-arcs (51E21) Finite affine and projective planes (geometric aspects) (51E15) Finite geometry and special incidence structures (51E99)

Cites Work

• Blocking sets in Desarguesian affine and projective planes
• On the size of a blocking set in \(\text{PG}(2,p)\)
• Blocking Sets in Desarguesian Projective Planes
• Small blocking sets in higher dimensions
• The construction of translation planes from projective spaces
• An empty interval in the spectrum of small weight codewords in the code from points and \(k\)-spaces of \(\mathrm{PG}(n,q)\)
• Covering all points except one
• Blocking Sets and Skew Subspaces of Projective Space

Cited In (8)

• On \(q\)-analogues and stability theorems
• On the Alon-Füredi bound
• Covering all points except one
• On zeros of a polynomial in a finite grid
• Large minimal covers of PG\((3,q)\)
• Towards the determination of the regular \(n\)-covers of \(PG (3,q)\)
• The resultant method in higher dimensions
• On a particular class of minihypers and its applications. I: The result for general \(q\)

This page was built for publication: Partial covers of \(\mathrm{PG}(n, q)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992790)