Problems Involving Diagonal Products in Nonnegative Matrices
From MaRDI portal
Publication:5563412
DOI10.2307/1994701zbMath0175.02404OpenAlexW4231046952MaRDI QIDQ5563412
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/1994701
Related Items
Diagonal Scaling to an Orthogonal Matrix, The Lattice of Patterns Induced by a Positive Cone of Functions, Nonnegative chainable matrices and Kolmogorov's condition, Diagonal similarity and equivalence for matrices over groups with 0, Concerning a Conjecture of Marshall Hall, Concerning a Conjecture of Marshall Hall, Matrices of zeros and ones with fixed row and column sum vectors, An upper bound for the chainable index, On partly and nearly decomposable tensors, A sharpened condition for strict log-convexity of the spectral radius via the bipartite graph, The construction and decomposition of patterns induced by a positive cone of functions, A role for doubly stochastic matrices in graph theory, Embedding nearly decomposable matrices into certain staircase matrices, A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices, On Constructing Nearly Decomposable Matrices, P-minors of a doubly stochastic matrix at which the permanent achieves a minimum, The chainable matrix, a special combinatorial matrix, Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n), Doubly stochastic matrices which have certain diagonals with constant sums, Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function, Nonnegative chainable matrices, The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, König and Markov, Doubly stochastic matrices with some equal diagonal sums, Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices, A unified treatment of nearly reducible and nearly decomposable matrices, Results on Measures of Irreducibility and Full Indecomposability, A lower bound for the permanent on \(U_ n(k,k)\), Arbitrarily regularizable graphs, A special class of irreducible matrices. The nearly reducible matrices, Nearly decomposable matrices, The DAD theorem for symmetric non-negative matrices, Methods for scaling to doubly stochastic form, Cyclic and diagonal products on a matrix, A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case, The rate of convergence of Sinkhorn balancing, Nonnegative Matrices Each of Whose Positive Diagonals Has the Same Sum
Cites Work
