Blockings-dimensional subspaces by lines inPG(2s,q)
暂无分享，去创建一个
We investigate sets of lines inPG(2s,q) such that everys-dimensional subspace contains a line of this set. We 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.
[1] Albrecht Beutelspacher,et al. A Characteristic Property of Geometric t-Spreads in Finite Projective Spaces , 1991, Eur. J. Comb..
[2] R. C. Bose,et al. A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes , 1966 .
[3] Jeff Kahn,et al. A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs , 1994, J. Comb. Theory, Ser. A.
[4] Peter J. Cameron,et al. Chapter 2 – Projective and Affine Geometry over Division Rings , 1995 .