1 research outputs found
Heden's bound on the tail of a vector space partition
A vector space partition of is a collection of subspaces
such that every non-zero vector is contained in a unique element. We improve a
lower bound of Heden, in a subcase, on the number of elements of the smallest
occurring dimension in a vector space partition. To this end, we introduce the
notion of -divisible sets of -subspaces in . By
geometric arguments we obtain non-existence results for these objects, which
then imply the improved result of Heden.Comment: 5 pages, extended versio