Extending partial permutation matrices
HTML articles powered by AMS MathViewer
- by Charles C. Lindner
- Proc. Amer. Math. Soc. 24 (1970), 834
- DOI: https://doi.org/10.1090/S0002-9939-1970-0255427-9
- PDF | Request permission
Abstract:
Let ${M_1},\;{M_2}, \cdots ,\;{M_s}$ be $n \times n$ arrays such that in each ${M_i}$, each cell is either empty or occupied by a $1$. It is shown that if ${M_1} + {M_2} + \cdots + {M_s}$ contains only $1$’s, the totality of $1$’s is less than or equal to $n - 1$, and the $1$’s are in different rows and columns, then the ${M_i}$’s can be completed to permutation matrices $M_1’ , \cdots ,M_s’$ so that $M_1’ + \cdots + M_s’$ is a $(0,\;1)$-matrix.References
- J. Marica and J. Schönheim, Incomplete diagonals of Latin squares, Canad. Math. Bull. 12 (1969), 235. MR 246786, DOI 10.4153/CMB-1969-030-5
Bibliographic Information
- © Copyright 1970 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 24 (1970), 834
- MSC: Primary 05.24
- DOI: https://doi.org/10.1090/S0002-9939-1970-0255427-9
- MathSciNet review: 0255427