Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-27T12:12:19.128Z Has data issue: false hasContentIssue false

An Elementary Proof of Johnson–Dulmage–Mendelsohn's Refinement of Birkhoff's Theorem on Doubly Stochastic Matrices

Published online by Cambridge University Press:  20 November 2018

Akihiro Nishi*
Affiliation:
Dept. of Mathematics Faculty of Education Saga University, 840 Saga, Japan
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A purely combinatorial and elementary proof of Johnson-Dulmage-Mendelsohn's theorem, which gives a quite sharp upper bound on the number of permutation matrices needed for representing a doubly stochastic matrix by their convex combination, is given.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1979

References

1. Birkhoff, G., Tres Observaciones sobre el Álgebra Lineal, Univ. Nac. Tucumân Rev. Ser. A, 5 (1946), 147-150.Google Scholar
2. Johnson, D. M., Dulmage, A. L. and Mendelsohn, N. S., On an Algorithm of G. Birkhoff concerning Doubly Stochastic Matrices, Canad. Math. Bull., 3 (1960), 237-242.Google Scholar
3. Dulmage, A. L. and Mendelsohn, N. S., A Structure Theory of Bipartite Graphs of Finite Exterior Dimention, Trans. Royal Soc. Canad. Ser. 3, 3 (1959), 1-13.Google Scholar
4. Mirsky, L., Results and Problems in the Theory of Doubly- Stochastic Matrices, Z. Wahrschein, 1 (1963), 319-334.Google Scholar
5. Mirsky, L., Transversal Theory, Academic Press, 1971.Google Scholar
6. Mirsky, L. and Perfect, H., Systems of Representatives, J. Math. Anal. Appl., 15 (1966), 520-568.Google Scholar
7. Sinkhorn, R. and Knopp, P., Problems Involving Diagonal Products in Nonnegative Matrices, Trans. Amer. Math. Soc, 139 (1969), 67-75.Google Scholar