On Schur-Ostrowski type theorems for group majorizations.
In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a well-known scheme for numbering the nodes of a network in such a way that the corresponding adjacency matrix has a narrow bandwidth. Inspired by some properties of the eigenvectors of a Laplacian matrix, we derive some properties based on row sums of a...
We investigate the formal matrix ring over defined by a certain system of factors. We give a method for constructing formal matrix rings from non-negative integer matrices. We also show that the principal factor matrix of a binary system of factors determine the structure of the system.
We disprove a conjecture made by Rajesh Pereira and Joanna Boneng regarding the upper bound on the number of doubly quasi-stochastic scalings of an n × n positive definite matrix. In doing so, we arrive at the true upper bound for 3 × 3 real matrices, and demonstrate that there is no such bound when n ≥ 4.