On the length of the tail of a vector space partition

DOI10.1016/j.disc.2009.05.026zbMath1235.51013OpenAlexW2084000075MaRDI QIDQ1045013

Olof Heden

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.026

zbMATH Keywords

perfect codesvector space partitions

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (18)

Improved upper bounds for partial spreads ⋮ The supertail of a subspace partition ⋮ Subspace partitions of \(\mathbb{F}_q^n\) containing direct sums. II: General case ⋮ On the type(s) of minimum size subspace partitions ⋮ Vector space partitions of GF(2)^8 ⋮ Extremal sizes of subspace partitions ⋮ Gaussian partitions ⋮ Some necessary conditions for vector space partitions ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ Partitions of V(n, q) into 2‐ and s‐Dimensional Subspaces ⋮ Subspace partitions of \(\mathbb{F}_q^n\) containing direct sums ⋮ The structure of the minimum size supertail of a subspace partition ⋮ The maximum size of a partial spread. II: Upper bounds ⋮ Partitions of finite vector spaces over \(\mathrm{GF}(2)\) into subspaces of dimensions 2 and \(s\) ⋮ Partitions of the 8-dimensional vector space over GF(2) ⋮ Generalized vector space partitions ⋮ The complete characterization of the minimum size supertail in a subspace partition ⋮ Heden's bound on the tail of a vector space partition

Cites Work

• On vector space partitions and uniformly resolvable designs
• Partitions of finite Abelian groups
• Partitions of a vector space
• A generalized Lloyd theorem and mixed perfect codes.
• Group Partition, Factorization and the Vector Covering Problem

This page was built for publication: On the length of the tail of a vector space partition