The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\) (Q849358)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximum size of a partial 3-spread in a finite vector space over GF(2) |
scientific article; zbMATH DE number 5675126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\) |
scientific article; zbMATH DE number 5675126 |
Statements
The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\) (English)
0 references
25 February 2010
0 references
The authors prove that the maximum number of 3-dimensional subspaces in \(V_{n}(2)\) with pairwise intersection \(\left\{ 0\right\} \) is \( \frac{2^{n}-2^{c}}{7}-c\) for \(n\geq 8\) and \(c=2\), where \(n\geq 3\) and \( V_{n}(2)\) represents the vector space of dimension \(n\) over \(\mathrm{GF}(2)\).
0 references
spreads
0 references
partial spreads
0 references
orthogonal arrays
0 references
\((s,k,\lambda)\)-nets
0 references
0 references
0 references
0.8453085422515869
0 references
0.8181086182594299
0 references
0.8152040839195251
0 references
0.8022140860557556
0 references
