English

The structure of the minimum size supertail of a subspace partition

Combinatorics 2016-06-02 v1

Abstract

Let V=V(n,q)V=V(n,q) denote the vector space of dimension nn over the finite field with qq elements. A subspace partition P{\mathcal P} of VV is a collection of nontrivial subspaces of VV such that each nonzero vector of VV is in exactly one subspace of P{\mathcal P}. For any integer dd, the dd-supertail of P{\mathcal P} is the set of subspaces in P{\mathcal P} of dimension less than dd, and it is denoted by STST. Let σq(n,t)\sigma_q(n,t) denote the minimum number of subspaces in any subspace partition of VV in which the largest subspace has dimension tt. It was shown by Heden et al. that STσq(d,t)|ST|\geq \sigma_q(d,t), where tt is the largest dimension of a subspace in STST. In this paper, we show that if ST=σq(d,t)|ST|=\sigma_q(d,t), then the union of all the subspaces in STST 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