Blocking Subspaces By Lines In PG(n, q)
✍ Scribed by Klaus Metsch
- Book ID
- 106167516
- Publisher
- Springer-Verlag
- Year
- 2004
- Tongue
- English
- Weight
- 349 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In a previous paper 1, all point sets of minimum size in __PG__(2,__q__), blocking all external lines to a given irreducible conic ${\cal C}$, have been determined for every odd __q__. Here we obtain a similar classification for those point sets of minimum size, which meet every externa
## Abstract The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sharp when __q__ is a square. Here the bound is improved if __q__ is a non‐square. On the other hand, we present some constructions of reasonably large minimal blocking sets in planes of non‐p
It will be shown that the smallest set B of points on the parabolic quadric Q(2n, q), q ≥ 4 and n ≥ 3, with the property that every (n -2)-dimensional subspace on Q(2n, q) has at least one point in common with B, consists of the non-singular points of an induced quadric π n-4 Q -(5, q) ⊆ Q(2n, q), w