✦ LIBER ✦

Intersection-sets in PG(n,2)

✍ Scribed by Aiden Bruen; Lucien Haddad; David Wehlau

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 450 KB
Volume: 62
Category: Article
ISSN: 0378-3758
DOI: 10.1016/s0378-3758(96)00161-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Icosahedral Sets in PG(5, 2)

✍ Ron Shaw 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 487 KB

Starting out from the 15 pairs of opposite edges and the 20 faces of a coloured icosahedron , a simple new construction is given of a 'double-five' of planes in PG (5 , 2) . This last is a recently discovered configuration consisting of a set of (15 ϩ 20 ϭ )35 points in PG (5 , 2) which admits five

Small point sets of PG(n,p3h) intersecti

Small point sets of PG(n,p3h) intersecting each line in 1 modphpoints

✍ Nóra V. Harrach; Klaus Metsch; Tamás Szőnyi; Zsuzsa Weiner 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 309 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

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

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

Tangency sets in PG(3, q)

✍ K. Metsch; L. Storme 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

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