Extremal sizes of subspace partitions
Abstract
A subspace partition of V=V(n,q) is a collection of subspaces of V such that each 1-dimensional subspace of V is in exactly one subspace of . The size of is the number of its subspaces. Let σq(n,t) denote the minimum size of a subspace partition of V in which the largest subspace has dimension t, and let q(n,t) denote the maximum size of a subspace partition of V in which the smallest subspace has dimension t. In this paper, we determine the values of σq(n,t) and q(n,t) for all positive integers n and t. Furthermore, we prove that if n≥ 2t, then the minimum size of a maximal partial t-spread in V(n+t-1,q) is σq(n,t).
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.