AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional subspaces of V required to cover the nonzero points of V is established. This is done by first regarding V as a field extension of F and then associating with each coset L of a subspace of V a polynomial whose roots are the points of L. A covering with cosets is then equivalent to a product of such polynomials having the minimal polynomial satisfied by all nonzero points of V as a factor
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
Based on the simple and well understood concept of subfields in a finite field, the technique called...
Let A be any subspace arrangement in Rn defined over the integers and let Fq denote the finite field...
AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional ...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
AbstractIn the construction of sets of orthogonal Latin hypercubes and in the study of finite projec...
AbstractLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
AbstractIf L is a field extension of K and V is an L-vector space, when is it possible to find in a ...
http://arxiv.org/PS_cache/math/pdf/0703/0703504v2.pdfWe prove that a sufficiently large subset of th...
We present a construction for minimal blocking sets with respect to (k-1)-spaces in PG (n-1,qt), the...
We present a construction for minimal blocking sets with respect to (k-1)-spaces in PG (n-1,qt), the...
Starting with a result in combinatorial number theory we prove that (apart from a couple of except...
AbstractIn this paper, we show that a set of q+a hyperplanes, q>13, a≤(q−10)/4, that does not cover ...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
Based on the simple and well understood concept of subfields in a finite field, the technique called...
Let A be any subspace arrangement in Rn defined over the integers and let Fq denote the finite field...
AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional ...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
AbstractIn the construction of sets of orthogonal Latin hypercubes and in the study of finite projec...
AbstractLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
AbstractIf L is a field extension of K and V is an L-vector space, when is it possible to find in a ...
http://arxiv.org/PS_cache/math/pdf/0703/0703504v2.pdfWe prove that a sufficiently large subset of th...
We present a construction for minimal blocking sets with respect to (k-1)-spaces in PG (n-1,qt), the...
We present a construction for minimal blocking sets with respect to (k-1)-spaces in PG (n-1,qt), the...
Starting with a result in combinatorial number theory we prove that (apart from a couple of except...
AbstractIn this paper, we show that a set of q+a hyperplanes, q>13, a≤(q−10)/4, that does not cover ...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
Based on the simple and well understood concept of subfields in a finite field, the technique called...
Let A be any subspace arrangement in Rn defined over the integers and let Fq denote the finite field...