Classification of large partial plane spreads in PG(6,2)PG(6,2) and related combinatorial objects

In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space partitions of $PG(6,2)$ of type $(3^{16} 4^1)$, binary $3\times 4$ MRD codes of minimum rank distance $3$, and subspace codes with parameters $(7,17,6)_2$ and $(7,34,5)_2$.Comment: 31 pages, 9 table

Partitions of finite vector spaces over GF(2) into subspaces of dimensions 2 and s

AbstractA vector space partition of a finite vector space V over the field of q elements is a collection of subspaces whose union is all of V and whose pairwise intersections are trivial. While a number of necessary conditions have been proved for certain types of vector space partitions to exist, the problem of the existence of partitions meeting these conditions is still open. In this note, we consider vector space partitions of a finite vector space over the field GF(2) into subspaces of dimensions 2 and s.While certain cases have been done previously (s=1, s=3, and s even), in our main theorem we build upon these general results to give a constructive proof for the existence of vector space partitions over GF(2) into subspaces of dimensions s and 2 of almost all types. In doing so, we introduce techniques that identify subsets of our vector space which can be viewed as the union of subspaces having trivial pairwise intersection in more than one way. These subsets are used to transform a given partition into another partition of a different type. This technique will also be useful in constructing further partitions of finite vector spaces