We present a test for determining if a substochastic matrix is convergent. By establishing a duality between weakly chained diagonally dominant (w.c.d.d.) Lmatrices and convergent substochastic matrices, we show that this test can be trivially extended to determine whether a weakly diagonally dominant (w.d.d.) matrix is a nonsingular M-matrix. The test’s runtime is linear in the order of the in...

Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...

For $A,Bin M_{nm},$ we say that $A$ is left matrix majorized (resp. left matrix submajorized) by $B$ and write $Aprec_{ell}B$ (resp. $Aprec_{ell s}B$), if $A=RB$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $R.$ Moreover, we define the relation $sim_{ell s} $ on $M_{nm}$ as follows: $Asim_{ell s} B$ if $Aprec_{ell s} Bprec_{ell s} A.$ This paper characterizes all linear p...

let $ m , n in mathbb{n}$, $d$ be a division ring, and $m_{m times n}(d)$ denote the bimodule of all $m times n$ matrices with entries from $d$. first, we characterize one-sided submodules of $m_{m times n}(d)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $d$. next, we introduce the notion of a nest module of matrices with entries from $d$. we ...

We construct Cheeger-type bounds for the second eigenvalue of a substochastic transition probability matrix in terms of the Markov chain’s conductance and metastability (and vice-versa) with respect to its quasi-stationary distribution, extending classical results for stochastic transition matrices.

(1) 2) vertex models and analytic Bethe ansätze We introduce fusion U q (G (1) 2) vertex models related to fundamental representations. The eigenvalues of their row to row transfer matrices are derived through analytic Bethe ansätze. By combining these results with our previous studies on functional relations among transfer matrices(the T-system), we conjecture explicit eigenvalues for a wide c...

It is well known that the inverse C = c i;j ] of an irreducible nonsingular symmetric tridiagonal matrix is a Green matrix, i.e. it satisses c i;j = u i v j for i j and two sequences of real numbers fu i g and fv i g. A similar result holds for nonsymmetric matrices A. There the inverse is given by four sequences fu i g; fv i g; fy i g; and fy i g: Here we characterize certain properties of A i...

Given a Graph G = ((V(G),E(G)), and a subset ) (G V S  , S with a given property(covering set, Dominating set, Neighbourhood set), we define a matrix taking a row for each of the minimal set corresponding to the given property and a column for each of the vertex of G. The elements of the matrix are 1 or 0 respectively as the vertex is contained in minimal set or otherwise. That is matrix (mij)...