Blocking subspaces by lines in PG(n,q)

DOI10.1007/S00493-004-0028-5MaRDI QIDQ558245zbMATH OpenOpenAlexFDO

Authors Klaus Metsch

Publication date 5 July 2005

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-004-0028-5

zbMATH Keywords

finite projective spacelineblocking subspace

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) General theory of linear incidence geometry and projective geometries (51A05) Spreads and packing problems in finite geometry (51E23)

Recommendations

• Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
• On linear blocking sets in \(PG(2,q^{t})\)
• Blocking sets in \(\mathrm{PG}(r,q^n)\)
• scientific article; zbMATH DE number 1833075
• scientific article; zbMATH DE number 7666857
• Blocking \((n-2)\)-dimensional subspaces on \(Q(2n,q)\)
• Linear \((q+1)\)-fold blocking sets in \(\text{PG} (2,q^4)\)
• Blocking sets in \(\text{PG}(2,q^n)\) from cones of \(\text{PG}(2n,q)\)
• Linear point sets and Rédei type \(k\)-blocking sets in \(\mathrm{PG}(n,q)\)
• \(\mathbb F _q\)-linear blocking sets in \(PG(2,q^4)\)

Cited in

(6)

• Blocking sets in projective spaces and polar spaces
• The number of lines needed to block all planes in \(PG(5,q)\)
• A note on \(q\)-covering designs in \(\mathrm{PG}(5,q)\)
• How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)
• On \(q\)-covering designs
• Galois geometries and coding theory

This page was built for publication: Blocking subspaces by lines in \(PG(n,q)\)

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