Blocking subspaces with points and hyperplanes

zbMATH Open1519.51004arXiv2208.14773MaRDI QIDQ6409345FDOQ6409345

Authors: Sam Adriaensen, Maarten De Boeck, Lins Denaux 

Publication date: 31 August 2022

Abstract: In this paper, we characterise the smallest sets $B$ consisting of points and hyperplanes in $extPG(n,q)$, such that each $k$-space is incident with at least one element of $B$. If $k>fracn-12$, then the smallest construction consists only of points. Dually, if $k<fracn-12$, the smallest example consists only of hyperplanes. However, if $k=fracn-12$, then there exist sets containing both points and hyperplanes, which are smaller than any blocking set containing only points or only hyperplanes.

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21)

This page was built for publication: Blocking subspaces with points and hyperplanes

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