Blockierende Mengen in endlichen projektiven Räumen
Abstract
In this work minimal -blocking sets of cardinality at most
in projective spaces
of
square order
,
, are characterized to be
-cones for some
with
.
In particular we will find the smallest
-blocking sets that
generate the whole space
for
.
Furthermore in projective spaces
of arbitrary order
new lower bounds for the cardinality of minimal
-blocking sets
are determined. Let
be the number such that
is
the cardinality of the smallest non-trivial line-blocking set in a
plane of order
. If
is a minimal
-blocking set in
that contains at most
points
for an integer
satisfying
, then the dimension
of
is at most
. If the dimension of
is
, then the following holds. The cardinality of
equals
. For
the set
is an
-dimensional subspace and for
the
set
is a cone with an
-dimensional vertex over a
non-trivial line-blocking set of cardinality
in a plane
skew to the vertex. For
and
not a prime the number
is
a square and
is a Baer cone. If
is odd and
, it follows
from this result that the subspace generated by
has dimension at
most
. Furthermore we prove that in this case, if
, then
is an
-dimensional subspace or
a cone with an
-dimensional vertex over a non-trivial
line-blocking set of cardinality
in a plane skew to the
vertex. For
,
and
not a square we show this
assertion for
.