Linear Point Sets and Rédei Type k-blocking Sets in PG(n, q)
✍ Scribed by L. Storme; P. Sziklai
- Book ID
- 110315986
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 82 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0925-9899
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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
## Abstract A tangency set of PG __(d,q)__ is a set __Q__ of points with the property that every point __P__ of __Q__ lies on a hyperplane that meets __Q__ only in __P__. It is known that a tangency set of PG __(3,q)__ has at most $q^2+1$ points with equality only if it is an ovoid. We show that a
## 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