The minimum volume of subspace trades

Abstract

A subspace bitrade of type $T_q(t,k,v)$ is a pair $(T_0,T_1)$ of two disjoint nonempty collections of $k$-dimensional subspaces of a $v$-dimensional space $V$ over the finite field of order $q$ such that every $t$-dimensional subspace of $V$ is covered by the same number of subspaces from $T_0$ and $T_1$. In a previous paper, the minimum cardinality of a subspace $T_q(t,t+1,v)$ bitrade was established. We generalize that result by showing that for admissible $v$, $t$, and $k$, the minimum cardinality of a subspace $T_q(t,k,v)$ bitrade does not depend on $k$. An example of a minimum bitrade is represented using generator matrices in the reduced echelon form. For $t=1$, the uniqueness of a minimum bitrade is proved.

v2: final; Appendix with a proof of properties using reduced echelon matrices

References in corpus (2)

• Lattices and Norton algebras of Johnson, Grassmann and Hamming graphs
• Isometric embeddings of dual polar graphs in Grassmann graphs over finite fields

Cited by in corpus (3)

• Minimum supports of functions on the Hamming graphs with spectral constraints
• A new series of large sets of subspace designs over the binary field
• On minimal subspace Zp-null designs