arXiv:1201.5994 [math.CO]AbstractReferencesReviewsResources
On sets of vectors of a finite vector space in which every subset of basis size is a basis II
Published 2012-01-28Version 1
This article contains a proof of the MDS conjecture for $k \leq 2p-2$. That is, that if $S$ is a set of vectors of ${\mathbb F}_q^k$ in which every subset of $S$ of size $k$ is a basis, where $q=p^h$, $p$ is prime and $q$ is not and $k \leq 2p-2$, then $|S| \leq q+1$. It also contains a short proof of the same fact for $k\leq p$, for all $q$.
Comments: 13 pp
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1511.03623 [math.CO] (Published 2015-11-11)
Inclusion Matrices and the MDS Conjecture
Counting subspaces of a finite vector space
arXiv:1803.02809 [math.CO] (Published 2018-03-07)
The size of the giant component in random hypergraphs: a short proof