Extremal sizes of subspace partitions
Combinatorics
2011-04-15 v1
Abstract
A subspace partition of is a collection of subspaces of such that each 1-dimensional subspace of is in exactly one subspace of . The size of is the number of its subspaces. Let denote the minimum size of a subspace partition of in which the largest subspace has dimension , and let denote the maximum size of a subspace partition of in which the smallest subspace has dimension . In this paper, we determine the values of and for all positive integers and . Furthermore, we prove that if , then the minimum size of a maximal partial -spread in is .
Cite
@article{arxiv.1104.2706,
title = {Extremal sizes of subspace partitions},
author = {Olof Heden and Juliane Lehmann and Esmeralda Nastase and Papa Sissokho},
journal= {arXiv preprint arXiv:1104.2706},
year = {2011}
}
Comments
11 pages