Invariant sets for classes of matrices of zeros and ones
HTML articles powered by AMS MathViewer
- by Richard A. Brualdi and Jeffrey A. Ross PDF
- Proc. Amer. Math. Soc. 80 (1980), 706-710 Request permission
Abstract:
Let $\mathfrak {A}(R,S)$ denote the class of all $m \times n$ matrices of 0’s and 1’s with row sum vector R and column sum vector S. A set $I \times J(I \subseteq \{ 1, \ldots ,m\} ,J \subseteq \{ 1, \ldots ,n\} )$ is said to be invariant if each matrix in $\mathfrak {A}(R,S)$ contains the same number of 1’s in the positions $I \times J$. We prove that if there are no invariant singletons, then an invariant set $I \times J$ satisfies $I = \emptyset ,I = \{ 1, \ldots ,m\} ,J = \emptyset$ or $J = \{ 1, \ldots ,n\}$.References
- Richard A. Brualdi and Jeffrey A. Ross, On Ryser’s maximum term rank formula, Linear Algebra Appl. 29 (1980), 33–38. MR 562747, DOI 10.1016/0024-3795(80)90228-1
- David Gale, A theorem on flows in networks, Pacific J. Math. 7 (1957), 1073–1082. MR 91855
- H. J. Ryser, Combinatorial properties of matrices of zeros and ones, Canadian J. Math. 9 (1957), 371–377. MR 87622, DOI 10.4153/CJM-1957-044-3
- Herbert John Ryser, Combinatorial mathematics, The Carus Mathematical Monographs, No. 14, Mathematical Association of America; distributed by John Wiley and Sons, Inc., New York, 1963. MR 0150048
Additional Information
- © Copyright 1980 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 80 (1980), 706-710
- MSC: Primary 05B20
- DOI: https://doi.org/10.1090/S0002-9939-1980-0587961-2
- MathSciNet review: 587961