How many s-subspaces must miss a point set in PG(d, q)

DOI10.1007/S00022-006-1889-0MaRDI QIDQ884682zbMATH OpenOpenAlexFDO

Authors Klaus Metsch

Publication date 7 June 2007

Published in Journal of Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00022-006-1889-0

zbMATH Keywords

blocking setfinite projective space

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Blocking sets, ovals, (k)-arcs (51E21)

Recommendations

• Blocking subspaces by lines in \(PG(n,q)\)
• Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
• Blocking sets in projective spaces and polar spaces
• On the number of flats spanned by a set of points in \(PG(d,q)\)
• On the smallest minimal blocking sets in projective space generating the whole space

Cited in

(11)

• The maximum number of lines contained in subsets of \(PG(k,2)\).
• On q-analogues and stability theorems
• Proof of a conjecture of Metsch
• Maximal cocliques and the chromatic number of the Kneser graph on chambers of \(\mathrm{PG}(3, q)\)
• On zeros of a polynomial in a finite grid
• scientific article; zbMATH DE number 7666857 (Why is no real title available?)
• Lines in higgledy-piggledy arrangement
• Subspaces intersecting in at most a point
• The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
• Subspace of a finite projective space containing many points of a given set
• A case study in almost-perfect security for unconditionally secure communication

This page was built for publication: How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)

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