Title data
Kurz, Sascha:
Heden's bound on the tail of a vector space partition.
Bayreuth
,
2018
. - 5 p.
This is the latest version of this item.
Project information
Project title: |
Project's official title Project's id Integer Linear Programming Models for Subspace Codes and Finite Geometry No information |
---|---|
Project financing: |
Deutsche Forschungsgemeinschaft |
Abstract in another language
A vector space partition of GF(q)^v is a collection of subspaces such that every non-zero vector is contained in a unique element. We improve a lower bound of Heden on the number of elements of the smallest occurring dimension.
Further data
Item Type: | Preprint, postprint |
---|---|
Keywords: | Galois geometry; vector space partitions |
Subject classification: | Mathematics Subject Classification Code: 51E23 (05B40) |
Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties Faculties > Faculty of Mathematics, Physics und Computer Science |
Result of work at the UBT: | Yes |
DDC Subjects: | 500 Science > 510 Mathematics |
Date Deposited: | 11 May 2018 07:12 |
Last Modified: | 18 Mar 2019 08:48 |
URI: | https://eref.uni-bayreuth.de/id/eprint/44090 |
Available Versions of this Item
-
Heden's bound on the tail of a vector space partition. (deposited 12 Aug 2017 21:00)
- Heden's bound on the tail of a vector space partition. (deposited 11 May 2018 07:12) [Currently Displayed]