A sign pattern is a sign pattern if has no zero entries. allows orthogonality if there exists a real orthogonal matrix whose sign pattern equals . Some sufficient conditions are given for a sign pattern matrix to allow orthogonality, and a complete characterization is given for sign patterns with to allow orthogonality.
Let be the set of nonnegative integers and the ring of integers. Let be the ring of matrices over generated by the following two matrices: one obtained from the identity matrix by shifting the ones one position to the right and the other one position down. This ring plays an important role in the study of directly finite rings. Calculation of invertible and idempotent elements of yields that the subrings generated by them coincide. This subring is the sum of the ideal consisting of...
A complete list of positive Tits-sincere one-peak posets is provided by applying combinatorial algorithms and computer calculations using Maple and Python. The problem whether any square integer matrix is ℤ-congruent to its transpose is also discussed. An affirmative answer is given for the incidence matrices and the Tits matrices of positive one-peak posets I.
The perturbed Laplacian matrix of a graph is defined as , where is any diagonal matrix and is a weighted adjacency matrix of . We develop a Fiedler-like theory for this matrix, leading to results that are of the same type as those obtained with the algebraic connectivity of a graph. We show a monotonicity theorem for the harmonic eigenfunction corresponding to the second smallest eigenvalue of the perturbed Laplacian matrix over the points of articulation of a graph. Furthermore, we use...
In this paperwe study the Hadamard product of inverse-positive matrices.We observe that this class of matrices is not closed under the Hadamard product, but we show that for a particular sign pattern of the inverse-positive matrices A and B, the Hadamard product A ◦ B−1 is again an inverse-positive matrix.