Multiple Blocking Sets in PG(n,q),n> 3
✍ Scribed by János Barát; Leo Storme
- Book ID
- 111579102
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Weight
- 182 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0925-1022
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