相关论文: Enumeration of some particular sextuple persymmetr…

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 count the number of some particular n-times 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 announce 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 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 expose our main results about rank problems concerning persymmetric matrices over F_2 associated to some exponential sums.

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.

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 =…

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)

We obtain using exponential quadratic sums, explicit expressions for the number of triple persymmetric matrices over F_2 of given rank. (A matrix [a(i,j)] is persymmetric if a(i,j) = a(r,s) for i+j = r+s)

In this paper, we show that there are infinitely many semisimple tensor (or monoidal) categories of rank two over an algebraically closed field $\mathbb F$.

We make an in-depth study of the known border rank (i.e. approximate) algorithms for the matrix multiplication tensor encoding the multiplication of an n x 2 matrix by a 2 x 2 matrix.

The paper explores the concept of the rank of a bicomplex matrix, delving into four distinct types of ranks and investigating conditions under which these ranks are equivalent. It also defines and analyzes the concept of idempotent row…

We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…

We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed…

We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for $2\times ... \times 2$ tensors and for tensors of small…

A presentation of numerical range for rectangular matrices is undertaken in this paper, introducing two different definitions and elaborating basic properties. Then we are extended to the treatment of rank-k numerical range.

Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…