Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1708.01113 v2 pith:ZVHV3KLT submitted 2017-08-03 math.CO

classification math.CO
keywords vectorhedenpartitionspaceboundmathbbsubspacesarguments
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

A vector space partition of $\mathbb{F}_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 $\mathbb{F}_q^v$. By geometric arguments we obtain non-existence results for these objects, which then imply the improved result of Heden.

Discussion (0). Continue with ORCID to comment.

Pith tools