THE CARDINALITY OF SETS OF k-INDEPENDENT VECTORS OVER FINITE FIELDS By S.B. Damelin
نویسندگان
چکیده
A set of vectors is k-independent if all its subsets with no more than k elements are linearly independent. We obtain a result concerning the maximal possible cardinality Indq(n, k) of a k-independent set of vectors in the n-dimensional vector space Fn q over the finite field Fq of order q. Namely, we give a necessary and sufficient condition for Indq(n, k) = n + 1.
منابع مشابه
Additive Energy and the Falconer Distance Problem in Finite Fields
We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of the Fourier transform on given sets. As an application of our observation, we find sufficient conditions on sets where the Falconer distance conjecture for fin...
متن کاملAn Analytic Approach to the Problem of Matroid Representibility: Summer REU 2015
A central problem in matroid theory—and by extension coding theory and finite geometry— is the problem of constructing matrices with a maximal number of columns such that every square submatrix formed by a subset of the columns is nonsingular. In this project, we apply the tools of analysis to this problem and demonstrate the value of such an approach. First, we introduce various quantities tha...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملSets of Unit Vectors with Small Subset Sums
We say that a family {xi | i ∈ [m]} of vectors in a Banach space X satisfies the k-collapsing condition if ‖∑i∈I xi‖ ≤ 1 for all k-element subsets I ⊆ {1,2, . . . ,m}. Let C (k,d) denote the maximum cardinality of a k-collapsing family of unit vectors in a d-dimensional Banach space, where the maximum is taken over all spaces of dimension d. Similarly, let C B(k,d) denote the maximum cardinalit...
متن کامل