Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\) (Q1385981)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\) |
scientific article |
Statements
Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\) (English)
0 references
6 May 1998
0 references
The aim of this paper is to investigate sets of lines in \(PG(d,q)\) such that every \(s\)-dimensional subspace contains a line of this set. The authors determine the minimum number of lines in such a set and show that there is only one type of such a set with this minimum number of lines. If \(d\leq 2s-1\), this problem is solved by \textit{A. Beutelspacher} and \textit{J. Ueberberg} [Eur. J. Comb. 12, No. 4, 277-281 (1991; Zbl 0752.05013)].
0 references
projective spaces
0 references
hyperplanes
0 references
\(S\)-spaces
0 references
0 references
