Add to ORKGAbstract. For non-negative integers r ≥ d, how small can a subset C ⊆ Fr2 be, given that for any v ∈ Fr2 there is a d-flat passing through v and contained in C ∪ {v}? Equivalently, how large can a subset B ⊆ Fr2 be, given that for any v ∈ Fr2 there is a linear d-subspace not blocked non-trivially by the translate B + v? A number of lower and upper bounds are obtained. 1
We find all minimal blocking sets of size 3 2 ðp þ 1Þ in PGð2; pÞ for p <41. There is one new spo...
AbstractThe interrelations between (upper and lower) Minkowski contents and (upper and lower) surfac...
AbstractA set T is said to cover a set system J if T meets all members of J. We raise the following ...
For non-negative integers $r\ge d$, how small can a subset $C\subset F_2^r$ be, given that for any $...
AbstractWe provide an upper bound of the size of an m-irreducible blocking set in a linear space. Th...
In this paper we collect results on the possible sizes of k-blocking sets. Since previous surveys fo...
AbstractWe show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyp...
Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F s...
AbstractWe prove that a small minimal blocking set of PG(2,q) is “very close” to be a linear blockin...
AbstractWe prove that in the desarguesian plane PG(2, qt) (t>4) there are at least three inequivalen...
We survey recent results concerning the size of blocking sets in desarguesian projective and affine ...
In view-obstruction problems, congruent copies of a closed, centrally symmetric, convex body C, cent...
AbstractWe study minimal blocking sets inPG(2, q) havingq+mpoints outside some fixed line. If0<m<(q)...
AbstractWe investigate how the dimension of a set X contained in lp can change as p is varied.Assume...
In this note we compare two ways of measuring the n-dimensional “flatness” of a set S⊂RdS⊂ℝd , where...
We find all minimal blocking sets of size 3 2 ðp þ 1Þ in PGð2; pÞ for p <41. There is one new spo...
AbstractThe interrelations between (upper and lower) Minkowski contents and (upper and lower) surfac...
AbstractA set T is said to cover a set system J if T meets all members of J. We raise the following ...
For non-negative integers $r\ge d$, how small can a subset $C\subset F_2^r$ be, given that for any $...
AbstractWe provide an upper bound of the size of an m-irreducible blocking set in a linear space. Th...
In this paper we collect results on the possible sizes of k-blocking sets. Since previous surveys fo...
AbstractWe show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyp...
Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F s...
AbstractWe prove that a small minimal blocking set of PG(2,q) is “very close” to be a linear blockin...
AbstractWe prove that in the desarguesian plane PG(2, qt) (t>4) there are at least three inequivalen...
We survey recent results concerning the size of blocking sets in desarguesian projective and affine ...
In view-obstruction problems, congruent copies of a closed, centrally symmetric, convex body C, cent...
AbstractWe study minimal blocking sets inPG(2, q) havingq+mpoints outside some fixed line. If0<m<(q)...
AbstractWe investigate how the dimension of a set X contained in lp can change as p is varied.Assume...
In this note we compare two ways of measuring the n-dimensional “flatness” of a set S⊂RdS⊂ℝd , where...
We find all minimal blocking sets of size 3 2 ðp þ 1Þ in PGð2; pÞ for p <41. There is one new spo...
AbstractThe interrelations between (upper and lower) Minkowski contents and (upper and lower) surfac...
AbstractA set T is said to cover a set system J if T meets all members of J. We raise the following ...