Papers
Topics
Authors
Recent
Search
2000 character limit reached

On minimal subspace Zp-null designs

Published 30 Nov 2020 in math.CO and cs.DM | (2012.00037v1)

Abstract: Let $q$ be a power of a prime $p$, and let $V$ be an $n$-dimensional space over the field GF$(q)$. A $Z_p$-valued function $C$ on the set of $k$-dimensional subspaces of $V$ is called a $k$-uniform $Z_p$-null design of strength $t$ if for every $t$-dimensional subspace $y$ of $V$ the sum of $C$ over the $k$-dimensional superspaces of $y$ equals $0$. For $q=p=2$ and $0\le t<k<n$, we prove that the minimum number of non-zeros of a non-void $k$-uniform $Z_p$-null design of strength $t$ equals $2^{t+1}$. For $q\>2$, we give lower and upper bounds for that number.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.