(0, 1)-Matrices, Discrepancy and Preservers
- 2 Downloads
Let m and n be positive integers, and let R = (r1, . . . , rm) and S = (s1, . . . , sn) be nonnegative integral vectors. Let A(R,S) be the set of all m × n (0, 1)-matrices with row sum vector R and column vector S. Let R and S be nonincreasing, and let F(R) be the m × n (0, 1)-matrix, where for each i, the ith row of F(R,S) consists of ri 1’s followed by (n−ri) 0’s. Let A ∈ A(R,S). The discrepancy of A, disc(A), is the number of positions in which F(R) has a 1 and A has a 0. In this paper we investigate linear operators mapping m × n matrices over the binary Boolean semiring to itself that preserve sets related to the discrepancy. In particular, we show that bijective linear preservers of Ferrers matrices are either the identity mapping or, when m = n, the transpose mapping.
KeywordsFerrers matrix row-dense matrix discrepancy linear preserver strong linear preserver
MSC 201015A04 15A21 15A86 05B20 05C50
Unable to display preview. Download preview PDF.
The author wishes to thank the referee whose many suggestions improved the presentation.
- L. B. Beasley, N. J. Pullman: Linear operators preserving properties of graphs. Proc. 20th Southeast Conf. on Combinatorics, Graph Theory, and Computing. Congressus Numerantium 70, Utilitas Mathematica Publishing, Winnipeg, 1990, pp. 105–112.Google Scholar