相关论文: Lonesum decomposable matrices

A multidimensional nonnegative matrix is called polystochastic if the sum of its entries over each line is equal to $1$. The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. We prove that if $d$…

If $D$ is a partially filled-in $(0,1)$-matrix with a unique completion to a $(0,1)$-matrix $M$ (with prescribed row and column sums), we say that $D$ is a {\em defining set} for $M$. A {\em critical set} is a minimal defining set (the…

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of…

For the class of $d\times d$ matrices $B=[b_{i,j}]$ with complex nonzero entries satisfying $\sum_{i=1}^{d}|b_{i,j}|=1$, we provide the conditions for the convergence of power matrices $B^n$ to a nonzero limit matrix. In particular, for…

The matrix $S = [1+x_i y_j]_{i,j=1}^{n}, 0<x_1<\cdots<x_n,\, 0<y_1<\cdots<y_n$, has gained importance lately due to its role in powers preserving total nonnegativity. We give an explicit decomposition of $S$ in terms of elementary…

The matrix semigroup membership problem asks, given square matrices $M,M_1,\ldots,M_k$ of the same dimension, whether $M$ lies in the semigroup generated by $M_1,\ldots,M_k$. It is classical that this problem is undecidable in general but…

Under suitable hypotheses on the ground field and on the matrix $M$, we discuss existence, uniqueness and properties of some additive decompositions of $M$ and of its image through a convergent series.

An $n\times n$ complex matrix $A$ is called coninvolutory if $\bar AA=I_n$ and skew-coninvolutory if $\bar AA=-I_n$ (which implies that $n$ is even). We prove that each matrix of size $n\times n$ with $n>1$ is a sum of 5 coninvolutory…

An $m \times (n+1)$ multiplicity matrix is a matrix $M = ( \mu_{i,j} )$ with rows enumerated by $i \in \{ 1,\ 2, \ldots, m \}$ and columns enumerated by $j \in \{ 0,1,\ldots, n \}$ whose coordinates are nonnegative integers satisfying the…

We show that a central linear mapping of a projectively embedded Euclidean $n$-space onto a projectively embedded Euclidean $m$-space is decomposable into a central projection followed by a similarity if, and only if, the least singular…

A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…

The problem of classifying modules over a tame algebra A reduces to a block matrix problem of tame type whose indecomposable canonical matrices are zero- or one-parameter. Respectively, the set of nonisomorphic indecomposable modules of…

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

Recently, Laplacian matrices of graphs are studied as density matrices in quantum mechanics. We continue this study and give conditions for separability of generalized Laplacian matrices of weighted graphs with unit trace. In particular, we…

In this work it is shown that the SD-KE decomposition is multiplicative under determinantal-type functions for graphs with perfect matchings, providing a new tool for the study of unimodular and singular matchable graphs.

We present a matrix version of a known method of constructing common eigenvectors of two diagonalizable commuting matrices, thus enabling their simultaneous diagonalization. The matrices may have simple eigenvalues of multiplicity greater…

A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the…

Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual…

Square matrices of the form $\widetilde{\mathbf{A}} =\mathbf{A} + \mathbf{e}D \mathbf{f}^*$ are considered. An explicit expression for the inverse is given, provided $\widetilde{\mathbf{A}}$ and $D$ are invertible with…

We study linear divisibility sequences of order 4, providing a characterization by means of their characteristic polynomials and finding their factorization as a product of linear divisibility sequences of order 2. Moreover, we show a new…