On minimal blocking sets
✍ Scribed by Jürgen Bierbrauer
- Book ID
- 112501623
- Publisher
- Springer
- Year
- 1980
- Tongue
- English
- Weight
- 321 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0003-889X
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 Bruen and Thas proved that the size of a large minimal blocking set is bounded by $q \cdot {\sqrt{q}} + 1$. Hence, if __q__ = 8, then the maximal possible size is 23. Since 8 is not a square, it was conjectured that a minimal blocking 23‐set does not exist in PG(2,8). We show that this
on small minimal blocking sets in P G(2, p 3 ), p prime, p ≥ 7, to small minimal blocking sets in P G(2, q 3 ), q = p h , p prime, p ≥ 7, with exponent e ≥ h. We characterize these blocking sets completely as being blocking sets of Rédei-type.