Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

Heden's bound on the tail of a vector space partition

URN to cite this document: urn:nbn:de:bvb:703-epub-3716-3

Title data

Kurz, Sascha:
Heden's bound on the tail of a vector space partition.
Bayreuth , 2018 . - 5 S.

This is the latest version of this item.

[img] PDF
tail_heden.pdf - Published Version
Available under License Creative Commons BY 4.0: Attribution .

Download (246kB)

Project information

Project title:
Project's official titleProject's id
Integer Linear Programming Models for Subspace Codes and Finite GeometryNo information

Project financing: Deutsche Forschungsgemeinschaft

Abstract

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, in a subcase, on the number of elements of the smallest occurring dimension in a vector space partition. To this end, we introduce the notion of q^r-divisible sets of k-subspaces in GF(q)^v. By geometric arguments we obtain non-existence results for these objects, which then imply the improved result of Heden.

Further data

Item Type: Preprint, postprint
Keywords: Galois geometry; vector space partitions
Subject classification: Mathematics Subject Classification Code: 51E23 (05B40)
DDC Subjects: 500 Science > 510 Mathematics
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 Mathematics in Economy
Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Language: English
Originates at UBT: Yes
URN: urn:nbn:de:bvb:703-epub-3716-3
Date Deposited: 11 May 2018 07:10
Last Modified: 18 Mar 2019 08:48
URI: https://epub.uni-bayreuth.de/id/eprint/3716

Available Versions of this Item