Problems Involving Diagonal Products in Nonnegative Matrices
From MaRDI portal
Cites work
Cited in
(38)- Matrices of zeros and ones with fixed row and column sum vectors
- The construction and decomposition of patterns induced by a positive cone of functions
- 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
- 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
- Methods for scaling to doubly stochastic form
- Cyclic and diagonal products on a matrix
- A sharpened condition for strict log-convexity of the spectral radius via the bipartite graph
- Nonnegative chainable matrices
- Nonnegative chainable matrices and Kolmogorov's condition
- A lower bound for the permanent on \(U_ n(k,k)\)
- A special class of irreducible matrices. The nearly reducible matrices
- Nearly decomposable matrices
- The DAD theorem for symmetric non-negative matrices
- On partly and nearly decomposable tensors
- Arbitrarily regularizable graphs
- Diagonal Scaling to an Orthogonal Matrix
- Results on Measures of Irreducibility and Full Indecomposability
- Diagonal similarity and equivalence for matrices over groups with 0
- Nonnegative Matrices Each of Whose Positive Diagonals Has the Same Sum
- The Lattice of Patterns Induced by a Positive Cone of Functions
- Concerning a Conjecture of Marshall Hall
- Concerning a Conjecture of Marshall Hall
- A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
- On Constructing Nearly Decomposable Matrices
- A role for doubly stochastic matrices in graph theory
- An upper bound for the chainable index
- Algebraically chainable matrices and their properties
- Linear bijective maps preserving the chainable index
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
- The rate of convergence of Sinkhorn balancing
- Embedding nearly decomposable matrices into certain staircase matrices
This page was built for publication: Problems Involving Diagonal Products in Nonnegative Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5563412)
