Improved upper bounds for partial spreads

Title data

Kurz, Sascha:
Improved upper bounds for partial spreads.
In: Designs, Codes and Cryptography. Vol. 85 (2017) Issue 1 . - pp. 97-106.
ISSN 1573-7586
DOI: https://doi.org/10.1007/s10623-016-0290-8

Related URLs

Project information

Abstract in another language

A partial (k-1)-spread} in PG(n-1,q) is a collection of (k-1)-dimensional subspaces with trivial intersection such that each point is covered at most once. So far the maximum size of a partial (k-1)-spread in PG(n-1,q) was know for the cases where n is congruent to 0 or 1 modulo k, and for the special case where n is congruent to 2 modulo k, but we additionally have q=2 and k=3. We completely resolve the case where n is congruent to 2 modulo k and q=2, i.e., the binary case.