Related papers: Realizable Lists on a Class of Nonnegative Matrice…

A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…

This paper is devoted to the study of eigenvalue region of the doubly stochastic matrices which are also permutative, that is, each row of such a matrix is a permutation of any other row. We call these matrices as permutative doubly…

In order to find a suitable expression of an arbitrary square matrix over an arbitrary finite commutative ring, we prove that every such a matrix is always representable as a sum of a potent matrix and a nilpotent matrix of order at most…

We show that if a list of nonzero complex numbers $\sigma=(\lambda_1,\lambda_2,\ldots,\lambda_k)$ is the nonzero spectrum of a diagonalizable nonnegative matrix, then $\sigma$ is the nonzero spectrum of a diagonalizable nonnegative matrix…

Let $n$ be a positive integer and $X = [x_{ij}]_{1 \leq i, j \leq n}$ be an $n \times n$\linebreak \noindent sized matrix of independent random variables having joint uniform distribution $$\hbox{Pr} {x_{ij} = k \hbox{for} 1 \leq k \leq n}…

A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matrix is reconstructible if it is uniquely determined by this…

A unimodular $2\times 2$ matrix with entries in a commutative $R$ is called extendable (resp.\ simply extendable) if it extends to an invertible $3\times 3$ matrix (resp.\ invertible $3\times 3$ matrix whose $(3,3)$ entry is $0$). We obtain…

A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it…

For any $n\ge 2$ and fixed $k\ge 1$, we give necessary and sufficient conditions for an arbitrary nonzero square matrix in the matrix ring $\mathbb{M}_n(\mathbb{F})$ to be written as a sum of an invertible matrix $U$ and a nilpotent matrix…

The main result of the note describes certain optimal-score partitions, which can be interpreted as optimal resource allocations. This result is based on the fact that any nonnegative square matrix whose column sums are the same as the…

Let L be a restricted Lie superalgebra with its enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We characterize L…

A celebrated theorem of Lind states that a positive real number is equal to the spectral radius of some integral primitive matrix, if and only if, it is a Perron algebraic integer. Given a Perron number $p$, we prove that there is an…

We show that a formal power series in $2N$ non-commuting indeterminates is a positive non-commutative kernel if and only if the kernel on $N$-tuples of matrices of any size obtained from this series by matrix substitution is positive. We…

Let L be a restricted Lie superalgebra with its restricted enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We…

Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…

If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4], [5] and [6] showed that, if a permutation-like matrix group contains a maximal cycle such that the…

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…

For every positive integer $n$ greater than $4$ there is a set of Latin squares of order $n$ such that every permutation of the numbers $1,\ldots,n$ appears exactly once as a row, a column, a reverse row or a reverse column of one of the…