On a conjecture concerning enumeration of 2n x k n-times persymmetric matrices over F_2 by rank
In this paper we announce a conjecture concerning enumeration of 2n x k n-times persymmetric matrices over F_2 by rank.
arXiv subjects
Publications and source records attributed to Jorgen Cherly.
In this paper we announce a conjecture concerning enumeration of 2n x k n-times persymmetric matrices over F_2 by rank.
In this paper we count the number of some particular sextuple persymmetric rank i matrices over F_2.
In this paper we count the number of some particular 2nx10 n-times rank i matrices over F_2.
In this paper we count the number of some particular 2n x 9 n-times rank i matrices over F_2.
In this paper we count the number of some particular quintuple persymmetric rank i matrices over F_2.
In this paper we count the number of some particular quadruple persymmetric rank i matrices over F_2.
In this paper we announce a conjecture concerning enumeration of n-times persymmetric matrices over F_2 by rank. To justify our statement we remark that the formulas obtained are valid for n equal to one, two and three.
In this paper we illustrate by some examples the connection between the number of solutions of polynomial equations satisfying degree conditions and the number of rank I matrices related to persymmetric matrices.
In this paper we expose our main results about rank problems concerning persymmetric matrices over F_2 associated to some exponential sums.
We obtain, using exponential quadratic sums, explicit expressions for the number of double persymmetric matrices with entries in F_2 of given rank. (A matix [a(i,j)) is persymmetric if a(i,j) = a(r,s) for i+j = r+s)
Over the finite field with two elements, we present a method for obtaining explicit expressions for the number of rank i matrices of the form A above B, where A is persymmetric (A matrix [a(i,j)] is persymmetric if a(i,j) = a(r,s) for i+j = r+s).