Upper bounds for partial spreads
Combinatorics
2017-04-05 v3
Abstract
A partial -spread in is a collection of -dimensional subspaces with trivial intersection such that each non-zero vector is covered at most once. We present some improved upper bounds on the maximum sizes.
Cite
@article{arxiv.1606.08581,
title = {Upper bounds for partial spreads},
author = {Sascha Kurz},
journal= {arXiv preprint arXiv:1606.08581},
year = {2017}
}
Comments
4 pages