Nearly decomposable matrices

DOI10.1016/0024-3795(72)90027-4zbMATH Open0235.05008OpenAlexW1973126616MaRDI QIDQ2551778FDOQ2551778

Authors: Henryk Minc 

Publication date: 1972

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(72)90027-4

Mathematics Subject Classification ID

Basic linear algebra (15A99) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cites Work

• Permanents
• Concerning a Conjecture of Marshall Hall
• On Lower Bounds for Permanents of (0, 1) Matrices
• Problems Involving Diagonal Products in Nonnegative Matrices

Cited In (8)

• Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
• Generalized scrambling indices of a primitive digraph
• A unified treatment of nearly reducible and nearly decomposable matrices
• An upper bound for the permanent of a nonnegative matrix
• Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods
• (0,1)-matrices with minimal permanents
• On the minimum value of the permanent of a nearly decomposable doubly stochastic matrix
• Embedding nearly decomposable matrices into certain staircase matrices

This page was built for publication: Nearly decomposable matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2551778)