Let S(q) denote the spectrum of minimal blocking sets in a projective plane of order q. Innamorati and Maturo (Ratio Math. 2 (1991) 151–155) proved that if q¿4 then [2q−1; 3q−5]∪ {3q − 3}⊆ S(q) and… (More)

The important role of Hadamard designs for applications in several fields has been long established. A considerable problem of finite geometry is to determine the configurations of the minimum number… (More)

Bruen and Thas proved that the size of a large minimal blocking set is bounded by q ffiffiffi q p þ 1. Hence, if q 1⁄4 8, then the maximal possible size is 23. Since 8 is not a square, it was… (More)

We prove that PGð2; 8Þ does not contain minimal blocking sets of size 14. Using this result we prove that 58 is the largest size for a maximal partial spread of PGð3; 8Þ. This supports the conjecture… (More)

In this paper we prove that in PG(3, q) a q 4+q2 2 −set of lines, having exactly q8−q7−q4+q3 8 pairs of skew lines, of type (m, m+ q 2+q 2 ) with respect to stars of lines and of type (m′, m′ + q 2+q… (More)

An important branch in finite geometry is the characterization of classical objects in a combinatorial way. In several situations, it might occur that one has information about the intersection… (More)