Extremal sizes of subspace partitions
From MaRDI portal
Publication:438885
DOI10.1007/S10623-011-9572-3zbMATH Open1255.51008arXiv1104.2706OpenAlexW2106235829MaRDI QIDQ438885FDOQ438885
Authors: Olof Heden, J. Lehmann, E. Năstase, Papa A. Sissokho
Publication date: 31 July 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: A subspace partition of is a collection of subspaces of such that each 1-dimensional subspace of is in exactly one subspace of . The size of is the number of its subspaces. Let denote the minimum size of a subspace partition of in which the largest subspace has dimension , and let denote the maximum size of a subspace partition of in which the smallest subspace has dimension . In this paper, we determine the values of and for all positive integers and . Furthermore, we prove that if , then the minimum size of a maximal partial -spread in is .
Full work available at URL: https://arxiv.org/abs/1104.2706
Recommendations
- The minimum size of a finite subspace partition
- On the type(s) of minimum size subspace partitions
- On the extremal number of subdivisions
- The structure of the minimum size supertail of a subspace partition
- Partitions and the maximal excludant
- Limit shape of subpartition-maximizing partitions
- scientific article; zbMATH DE number 35216
- The asymptotic optimal partition and extensions of the nonsubstitution theorem
- scientific article; zbMATH DE number 1047707
Steiner systems in finite geometry (51E10) Finite partial geometries (general), nets, partial spreads (51E14) Spreads and packing problems in finite geometry (51E23)
Cites Work
- A General Class of Maximal Codes ror Computer Applications
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Partitions of a vector space
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- On the length of the tail of a vector space partition
- Partitions of the 8-dimensional vector space over GF(2)
- The minimum size of a finite subspace partition
- Some necessary conditions for vector space partitions
- Group Partition, Factorization and the Vector Covering Problem
- Partitions of finite Abelian groups
- On vector space partitions and uniformly resolvable designs
- Existence and construction of randomization defining contrast subspaces for regular factorial designs
- A note on maximal partial spreads with deficiency \(q+1\), \(q\) even
- On maximal partial spreads in \(PG\)(\(n\), \(q\))
- Small maximal partial \(t\)-spreads
- On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Blocking sets in PG(2, p) for small p, and partial spreads in PG(3,7)
- A maximal partial spread of size 45 in \(PG(3,7)\)
Cited In (17)
- Invariant codes, difference schemes, and distributive quasigroups
- Partial spreads in random network coding
- On the type(s) of minimum size subspace partitions
- Reconfiguration of subspace partitions
- On Extremal Set Partitions in Cartesian Product Spaces
- Title not available (Why is that?)
- Subspace partitions of \(\mathbb{F}_q^n\) containing direct sums
- The structure of the minimum size supertail of a subspace partition
- The complete characterization of the minimum size supertail in a subspace partition
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- Sharp covering of a module by cyclic submodules
- The Frobenius number and partitions of a finite vector space
- Limit shape of subpartition-maximizing partitions
- The extremal number of longer subdivisions
- The supertail of a subspace partition
- The minimum size of a finite subspace partition
- On the length of the tail of a vector space partition
This page was built for publication: Extremal sizes of subspace partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438885)