A minimal completion of doubly substochastic matrix
- 5 February 2016
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 64 (11) , 2313-2334
Abstract
Let B be an doubly substochastic matrix and let s be the sum of all entries of B. In this paper, we show that B has a sub-defect of k, which can be computed by taking the ceiling of if and only if there exists an doubly stochastic extension containing B as a submatrix and k minimal. We also propose a procedure constructing a minimal completion of B, and then express it as a convex combination of partial permutation matrices.Keywords
This publication has 5 references indexed in Scilit:
- Inequalities1965
- A short proof of the Farahat-Mirsky refinement of Birkhoff's theorem on doubly-stochastic matricesMathematical Proceedings of the Cambridge Philosophical Society, 1961
- On a convex set of matricesArchiv der Mathematik, 1959
- 1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem1953
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935