The structure of the minimum size supertail of a subspace partition
Combinatorics
2016-06-02 v1
Abstract
Let denote the vector space of dimension over the finite field with elements. A subspace partition of is a collection of nontrivial subspaces of such that each nonzero vector of is in exactly one subspace of . For any integer , the -supertail of is the set of subspaces in of dimension less than , and it is denoted by . Let denote the minimum number of subspaces in any subspace partition of in which the largest subspace has dimension . It was shown by Heden et al. that , where is the largest dimension of a subspace in . In this paper, we show that if , then the union of all the subspaces in constitutes a subspace under certain conditions.
Keywords
Cite
@article{arxiv.1606.00120,
title = {The structure of the minimum size supertail of a subspace partition},
author = {E. Nastase and P. Sissokho},
journal= {arXiv preprint arXiv:1606.00120},
year = {2016}
}
Comments
15 pages