Back to Search Start Over

Extremal sizes of subspace partitions.

Authors :
Heden, Olof
Lehmann, Juliane
Năstase, Esmeralda
Sissokho, Papa
Source :
Designs, Codes & Cryptography; Sep2012, Vol. 64 Issue 3, p265-274, 10p
Publication Year :
2012

Abstract

A subspace partition Π of V = V( n, q) is a collection of subspaces of V such that each 1-dimensional subspace of V is in exactly one subspace of Π. The size of Π is the number of its subspaces. Let σ( n, t) denote the minimum size of a subspace partition of V in which the largest subspace has dimension t, and let ρ( n, t) denote the maximum size of a subspace partition of V in which the smallest subspace has dimension t. In this article, we determine the values of σ( n, t) and ρ( n, t) for all positive integers n and t. Furthermore, we prove that if n ≥ 2 t, then the minimum size of a maximal partial t-spread in V( n + t −1, q) is σ( n, t). [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
09251022
Volume :
64
Issue :
3
Database :
Complementary Index
Journal :
Designs, Codes & Cryptography
Publication Type :
Academic Journal
Accession number :
76912494
Full Text :
https://doi.org/10.1007/s10623-011-9572-3