On sets of vectors of a finite vector space in which every subset of\n basis size is a basis II
Simeon Ball, Jan De Beule
Abstract
Open-access reader
Simeon Ball, Jan De Beule
Abstract
Open-access reader
This article contains a proof of the MDS conjecture for $k \\leq 2p-2$. That\nis, that if $S$ is a set of vectors of ${\\mathbb F}_q^k$ in which every subset\nof $S$ of size $k$ is a basis, where $q=p^h$, $p$ is prime and $q$ is not and\n$k \\leq 2p-2$, then $|S| \\leq q+1$. It also contains a short proof of the same\nfact for $k\\leq p$, for all $q$.\n
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article contains a proof of the MDS conjecture for $k \\leq 2p-2$. That\nis, that if $S$ is a set of vectors of ${\\mathbb F}_q^k$ in which every subset\nof $S$ of size $k$ is a basis, where $q=p^h$, $p$ is prime and $q$ is not and\n$k \\leq 2p-2$, then $|S| \\leq q+1$. It also contains a short proof of the same\nfact for $k\\leq p$, for all $q$.\n
Key concepts: Basis (linear algebra), Combinatorics, Conjecture, Mathematics, Vector space, Prime (order theory), Space (punctuation), Set (abstract data type)