✦ LIBER ✦

Small Minimal Blocking Sets inPG(2, q3)

✍ Scribed by O Polverino; L Storme

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 109 KB
Volume: 23
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2001.0545

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On large minimal blocking sets in PG(2,q

On large minimal blocking sets in PG(2,q)

✍ Tamás Szőnyi; Antonello Cossidente; András Gács; Csaba Mengyán; Alessandro Sicil 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 1 views

## 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

On the Size of a Double Blocking Set inP

On the Size of a Double Blocking Set inPG(2,q)

✍ Simeon Ball; Aart Blokhuis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 212 KB

We obtain lower bounds for the size of a double blocking set in the Desarguesian projective plane PG(2, q). These bounds are best possible for q Ͻ 11 and in the case q is a square. With the same technique we also exclude certain values for the size of an ordinary minimal blocking set.

The smallest minimal blocking sets of Q(

The smallest minimal blocking sets of Q(6, q), q even

✍ J. De Beule; L. Storme 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 1 views

## Abstract We characterize the smallest minimal blocking sets of Q(6,__q__), __q__ even and __q__ ≥ 32. We obtain this result using projection arguments which translate the problem into problems concerning blocking sets of Q(4,__q__). Then using results on the size of the smallest minimal blocking

On the Size of a Triple Blocking Set inP

On the Size of a Triple Blocking Set inPG(2, q)

✍ Simeon Ball 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 318 KB

Largest minimal blocking sets in PG(2,8)

✍ J. Barát; S. Innamorati 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 1 views

## 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

Linear (q+1)-fold Blocking Sets in PG(2,

Linear (q+1)-fold Blocking Sets in PG(2, q4)

✍ Simeon Ball; Aart Blokhuis; Michel Lavrauw 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 109 KB