English

The maximum size of a partial spread II: Upper bounds

Combinatorics 2017-07-05 v2

Abstract

Let nn and tt be positive integers with t<nt<n, and let qq be a prime power. A partial (t1)(t-1)-spread of PG(n1,q){\rm PG}(n-1,q) is a set of (t1)(t-1)-dimensional subspaces of PG(n1,q){\rm PG}(n-1,q) that are pairwise disjoint. Let rn(modt)r\equiv n\pmod{t} with 0r<t0\leq r<t, and let θi=(qi1)/(q1){\theta}_i=(q^i-1)/(q-1). We essentially prove that if 2r<tθr2\leq r<t\leq {\theta}_r, then the maximum size of a partial (t1)(t-1)-spread of PG(n1,q){\rm PG}(n-1,q) is bounded from above by (θnθt+r)/θt+qr(q1)(t3)+1({\theta}_n-{\theta}_{t+r})/{\theta}_t+q^r-(q-1)(t-3)+1. We actually give tighter bounds when certain divisibility conditions are satisfied. These bounds improve on the previously known upper bound for the maximum size partial (t1t-1)-spreads of PG(n1,q){\rm PG}(n-1,q); for instance, when θr2+4tθr\lceil\frac{{\theta}_r}{2}\rceil+4\leq t\leq {\theta}_r and q>2q>2. The exact value of the maximum size partial (t1)(t-1)-spread has been recently determined for t>θrt>{\theta}_r by the authors of this paper (see N\u{a}stase-Sissokho [21]).

Keywords

Cite

@article{arxiv.1606.09208,
  title  = {The maximum size of a partial spread II: Upper bounds},
  author = {Esmeralda Nastase and Papa Sissokho},
  journal= {arXiv preprint arXiv:1606.09208},
  year   = {2017}
}

Comments

Journal Version

R2 v1 2026-06-22T14:38:47.761Z