Heden's bound on the tail of a vector space partition
Abstract
A vector space partition of Fqv 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 qr-divisible sets of k-subspaces in Fqv. By geometric arguments we obtain non-existence results for these objects, which then imply the improved result of Heden.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.