This article continues the study of multiple blocking sets in PG(2, q). In [A. Blokhuis, L. Storme, T. Szonyi, Lacunary polynomials, multiple blocking sets and Baer subplanes. J. London Math. Soc. (2) 60 (1999), 321–332. MR1724814 (2000j:05025) Zbl 0940.51007], using lacunary polynomials, it was proven that t-fold blocking sets of PG(2, q), q square, t <q¼/2, of size smaller than t(q + 1) + cqq¿, with cq = 2-¿ when q is a power of 2 or 3 and cq = 1 otherwise, contain the union of t pairwise disjoint Baer subplanes when t = 2, or a line or a Baer subplane when t = 1. We now combine the method of lacunary polynomials with the use of algebraic curves to improve the known characterization results on multiple blocking sets and to prove a t (m...
AbstractWe prove that in the desarguesian plane PG(2, qt) (t>4) there are at least three inequivalen...
We show that, for small t, the smallest set that blocks the long secants of the union of t pairwise ...
Let Ω and B̄ be a subset of ∑ = PG(2n-1,q) and a subset of PG(2n,q) respectively, with ∑ ⊂ PG(2n,q) ...
This article continues the study of multiple blocking sets in PG(2, q). In [A. Blokhuis, L. Storme, ...
In [10], it was shown that small t-fold (n - k)-blocking sets in PG(n, q), q = p(h), p prime, h >= 1...
A (q + 1)-fold blocking set of size (q + 1)(q4 + q2 + 1) in PG(2, q4) is constructed, which is not t...
The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sha...
AbstractA (q+1)-fold blocking set of size (q+1)(q4+q2+1) in PG(2, q4) which is not the union of q+1 ...
Let $PG(2,q)$ be the Galois plane of order q and let $n(q)$ be the minimum integer such that there e...
In this paper, by using properties of Baer subplanes, we describe the construction of a minimal bloc...
AbstractLower bounds are obtained for the size of a triple blocking set in the Desarguesian projecti...
A $(q+1)$-fold blocking set of size $(q+1)(q^4 + q^2 + 1)$ in $PG(2,q^4)$ is constructed, which is ...
We obtain lower bounds for the size of a double blocking set in the Desarguesian projective planePG(...
AbstractIn this paper we show that blocking sets of cardinality less than 3(q+ 1)/2 (q=pn) in Desarg...
Let S be a Desarguesian (n-1)-spread of a hyperplane ∑ of PG(rn, q). Let Ω and B̄ be, respectively, ...
AbstractWe prove that in the desarguesian plane PG(2, qt) (t>4) there are at least three inequivalen...
We show that, for small t, the smallest set that blocks the long secants of the union of t pairwise ...
Let Ω and B̄ be a subset of ∑ = PG(2n-1,q) and a subset of PG(2n,q) respectively, with ∑ ⊂ PG(2n,q) ...
This article continues the study of multiple blocking sets in PG(2, q). In [A. Blokhuis, L. Storme, ...
In [10], it was shown that small t-fold (n - k)-blocking sets in PG(n, q), q = p(h), p prime, h >= 1...
A (q + 1)-fold blocking set of size (q + 1)(q4 + q2 + 1) in PG(2, q4) is constructed, which is not t...
The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sha...
AbstractA (q+1)-fold blocking set of size (q+1)(q4+q2+1) in PG(2, q4) which is not the union of q+1 ...
Let $PG(2,q)$ be the Galois plane of order q and let $n(q)$ be the minimum integer such that there e...
In this paper, by using properties of Baer subplanes, we describe the construction of a minimal bloc...
AbstractLower bounds are obtained for the size of a triple blocking set in the Desarguesian projecti...
A $(q+1)$-fold blocking set of size $(q+1)(q^4 + q^2 + 1)$ in $PG(2,q^4)$ is constructed, which is ...
We obtain lower bounds for the size of a double blocking set in the Desarguesian projective planePG(...
AbstractIn this paper we show that blocking sets of cardinality less than 3(q+ 1)/2 (q=pn) in Desarg...
Let S be a Desarguesian (n-1)-spread of a hyperplane ∑ of PG(rn, q). Let Ω and B̄ be, respectively, ...
AbstractWe prove that in the desarguesian plane PG(2, qt) (t>4) there are at least three inequivalen...
We show that, for small t, the smallest set that blocks the long secants of the union of t pairwise ...
Let Ω and B̄ be a subset of ∑ = PG(2n-1,q) and a subset of PG(2n,q) respectively, with ∑ ⊂ PG(2n,q) ...