AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of partitioning V into subspaces
AbstractIn this article, we develop an algorithm to calculate the set of all integers m for which th...
Abstract. For a finite vector space V and a non-negative integer r ≤ dimV we es-timate the smallest ...
Subspaces of vector spaces that are invariant under the action of a linear operator have garnered a ...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractWe show that the existence of a nontrivial proper subspace of a vector space of dimension gr...
AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional ...
Abstract. We answer a question by Niederreiter concerning the enumeration of a class of subspaces of...
AbstractA vector space partition of a finite vector space V over the field of q elements is a collec...
AbstractLet V denote V(n,q), the vector space of dimension n over GF(q). A subspace partition of V i...
AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional ...
Abstract. We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration...
AbstractThe principal result of this paper provides a nearly complete answer to the following questi...
AbstractA vector space partition P of a finite dimensional vector space V=V(n,q) of dimension n over...
AbstractTo each k-dimensional subspace of an n-dimensional vector space ove GF(q) we assign a number...
AbstractThe principal result of this paper provides a nearly complete answer to the following questi...
AbstractIn this article, we develop an algorithm to calculate the set of all integers m for which th...
Abstract. For a finite vector space V and a non-negative integer r ≤ dimV we es-timate the smallest ...
Subspaces of vector spaces that are invariant under the action of a linear operator have garnered a ...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractWe show that the existence of a nontrivial proper subspace of a vector space of dimension gr...
AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional ...
Abstract. We answer a question by Niederreiter concerning the enumeration of a class of subspaces of...
AbstractA vector space partition of a finite vector space V over the field of q elements is a collec...
AbstractLet V denote V(n,q), the vector space of dimension n over GF(q). A subspace partition of V i...
AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional ...
Abstract. We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration...
AbstractThe principal result of this paper provides a nearly complete answer to the following questi...
AbstractA vector space partition P of a finite dimensional vector space V=V(n,q) of dimension n over...
AbstractTo each k-dimensional subspace of an n-dimensional vector space ove GF(q) we assign a number...
AbstractThe principal result of this paper provides a nearly complete answer to the following questi...
AbstractIn this article, we develop an algorithm to calculate the set of all integers m for which th...
Abstract. For a finite vector space V and a non-negative integer r ≤ dimV we es-timate the smallest ...
Subspaces of vector spaces that are invariant under the action of a linear operator have garnered a ...
DOI
Add to ORKG