On minimal subspace Zp-null designs

11/30/2020
by   Denis S. Krotov, et al.
0

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≤ 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2019

Subspace Packings – Constructions and Bounds

The Grassmannian G_q(n,k) is the set of all k-dimensional subspaces of t...
research
04/04/2019

On the number of non-G-equivalent minimal abelian codes

Let G be a finite abelian group. We prove that the number of non-G-equiv...
research
07/03/2020

Almost Affinely Disjoint Subspaces

In this work, we introduce a natural notion concerning vector finite spa...
research
04/27/2022

On subspace designs

The aim of this paper is to investigate the theory of subspace designs, ...
research
02/09/2010

Probabilistic Recovery of Multiple Subspaces in Point Clouds by Geometric lp Minimization

We assume data independently sampled from a mixture distribution on the ...
research
12/02/2018

Dynamic Patch Generation for Null Pointer Exceptions using Metaprogramming

Null pointer exceptions (NPE) are the number one cause of uncaught crash...
research
10/01/2019

Thresholds in the Lattice of Subspaces of (F_q)^n

Let Q be an ideal (downward-closed set) in the lattice of linear subspac...

Please sign up or login with your details

Forgot password? Click here to reset