A 1-norm bound for inverses of triangular matrices with monotone entries.
A Bound Connected with Primitive Matrices.
A Bruhat order for the class of -matrices with row sum vector and column sum vector .
A canonical directly infinite ring
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 characterization of evolutionarily stable strategies.
A class of inverse -matrices.
A combinatorial approach to the conditioning of a single entry in the stationary distribution for a Markov chain.
A combinatorial problem arising in finite Markov chains
A computation of positive one-peak posets that are Tits-sincere
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.
A conjecture on a class of matrices
A contribution to Collatz's eigenvalue inclusion theorem for nonnegative irreducible matrices.
A counting theorem in the semigroup of circulant Boolean matrices
A Factorization of an Integral 2 x 2 Matrix Via a Rational Method.
A Fiedler-like theory for the perturbed Laplacian
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...
A footnote on quaternion block-tridiagonal systems.
A free analogue of the transportation cost inequality on the circle
A generalization of a theorem of Boolean relation matrices
A geometric construction for spectrally arbitrary sign pattern matrices and the -conjecture
We develop a geometric method for studying the spectral arbitrariness of a given sign pattern matrix. The method also provides a computational way of computing matrix realizations for a given characteristic polynomial. We also provide a partial answer to -conjecture. We determine that the -conjecture holds for the class of spectrally arbitrary patterns that have a column or row with at least nonzero entries.
A Hadamard product involving inverse-positive matrices
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.
A linear assignment formulation of the multiattribute decision problem