The maximum size of a partial spread. II: Upper bounds

DOI10.1016/J.DISC.2017.02.001MaRDI QIDQ526224zbMATH OpenOpenAlexFDO

Authors E. Năstase, Papa A. Sissokho

Publication date 10 May 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.09208

zbMATH Keywords

subspace codespartial spreadsGalois geometrysubspace partitions

Mathematics Subject Classification ID

Finite partial geometries (general), nets, partial spreads (51E14)

Abstract: Let $n$ and $t$ be positive integers with $t<n$, and let $q$ be a prime power. A partial $(t-1)$-spread of $mPG(n-1,q)$ is a set of $(t-1)$-dimensional subspaces of $mPG(n-1,q)$ that are pairwise disjoint. Let $requivnpmodt$ with $0leqr<t$, and let ${heta}_i=(q^i-1)/(q-1)$. We essentially prove that if $2leqr<tleq{heta}_r$, then the maximum size of a partial $(t-1)$-spread of $mPG(n-1,q)$ is bounded from above by $({heta}_n-{heta}_{t+r})/{heta}_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 ($t-1$)-spreads of $mPG(n-1,q)$; for instance, when $lceilfrac{heta}_{r}2ceil+4leqtleq{heta}_r$ and $q>2$. The exact value of the maximum size partial $(t-1)$-spread has been recently determined for $t>{heta}_r$ by the authors of this paper (see Nu{a}stase-Sissokho [21]).

Recommendations

• The maximum size of a partial spread in a finite projective space
• Improved upper bounds for partial spreads
• Small maximal partial \(t\)-spreads
• The maximum size of a partial spread in \(H(4n+1, q^{2})\) is \(q^{2n+1}+1\)
• Small maximal partial \(t\)-spreads in \(\mathrm{PG}(2t+1 , q)\)

Cites work

• scientific article; zbMATH DE number 3257050 (Why is no real title available?)
• A General Class of Maximal Codes ror Computer Applications
• A note on maximal partial spreads with deficiency \(q+1\), \(q\) even
• A survey of the different types of vector space partitions
• Coding for Errors and Erasures in Random Network Coding
• Error-Correcting Codes in Projective Space
• Group Partition, Factorization and the Vector Covering Problem
• Improved upper bounds for partial spreads
• On maximal partial spreads in PG(n, q)
• On the length of the tail of a vector space partition
• On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
• Partial spreads in finite projective spaces and partial designs
• Partial spreads in random network coding
• Partial t-spreads and group constructible \((s,r,\mu)\)-nets
• Perfect byte-correcting codes
• Some necessary conditions for vector space partitions
• Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
• Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe

Cited in

(13)

• New lower bounds for binary constant-dimension subspace codes
• The maximum size of a partial spread in a finite projective space
• Partial spreads over \({\mathbb{Z}}_ q\)
• Improved upper bounds for partial spreads
• On the size of a maximal partial spread
• All Maximum Size Two-Part Sperner Systems: In Short
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
• Small maximal partial \(t\)-spreads in \(\mathrm{PG}(2t+1 , q)\)
• The Frobenius number and partitions of a finite vector space
• scientific article; zbMATH DE number 3868100 (Why is no real title available?)
• Small maximal partial \(t\)-spreads
• On network codes and partial spreads
• scientific article; zbMATH DE number 2216156 (Why is no real title available?)

This page was built for publication: The maximum size of a partial spread. II: Upper bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526224)