Generalized vector space partitions
Combinatorics
2019-01-17 v2
Abstract
A vector space partition in is a set of subspaces such that every -dimensional subspace of is contained in exactly one element of . Replacing "every point" by "every -dimensional subspace", we generalize this notion to vector space -partitions and study their properties. There is a close connection to subspace codes and some problems are even interesting and unsolved for the set case .
Cite
@article{arxiv.1803.10180,
title = {Generalized vector space partitions},
author = {Daniel Heinlein and Thomas Honold and Michael Kiermaier and Sascha Kurz},
journal= {arXiv preprint arXiv:1803.10180},
year = {2019}
}
Comments
12 pages, typos corrected