How many s-subspaces must miss a point set in PG(d, q)
In [\textit{T. Szőnyi} and \textit{Z. Weiner}, ``On some stability theorems in finite geometry, manuscript] it is shown that if \(B\) is a set of points in \(\text{PG}(2,q)\) and \(P\) is a point not in \(B\) that is incident with precisely \(r\) lines which meet \(B\), then the total number of lines meeting \(B\) is at most \(1+rq+(| B| -r)(q+1-r)\). The proof of this fact is algebraic. In the paper under review the author uses this result as a key ingredient in a very clever combinatorial induction argument to determine the smallest number of \(s\)-subspaces in \(\text{PG}(n,q)\) that miss a point set of given cardinality. In particular, it is shown that the number of lines in \(\text{PG}(3,q)\) missing a set of \(b\) points, with \(q+1 < b \leq q^2+q+1\), is at least \((q^2+q+1-b)q^2\), and moreover this minimum can be achieved only for a planar set of \(b\) points that meets every line in that plane.
- 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
- Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
- On the number of flats spanned by a set of points in \(PG(d,q)\)
- The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
- Subspaces intersecting in at most a point
- The maximum number of lines contained in subsets of PG(k,2).
- Lines in higgledy-piggledy arrangement
- On q-analogues and stability theorems
- On zeros of a polynomial in a finite grid
- A case study in almost-perfect security for unconditionally secure communication
- Subspace of a finite projective space containing many points of a given set
- Proof of a conjecture of Metsch
- scientific article; zbMATH DE number 7666857 (Why is no real title available?)
- Maximal cocliques and the chromatic number of the Kneser graph on chambers of \(\mathrm{PG}(3, q)\)
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)
