( 0 , 1 ) -matrices, discrepancy and preservers

LeRoy B. Beasley

Czechoslovak Mathematical Journal (2019)

  • Volume: 69, Issue: 4, page 1123-1131
  • ISSN: 0011-4642

Abstract

top
Let m and n be positive integers, and let R = ( r 1 , ... , r m ) and S = ( s 1 , ... , s n ) 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 i th row of F ( R , S ) consists of r i 1’s followed by ( n - r i ) 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.

How to cite

top

Beasley, LeRoy B.. "$(0,1)$-matrices, discrepancy and preservers." Czechoslovak Mathematical Journal 69.4 (2019): 1123-1131. <http://eudml.org/doc/294867>.

@article{Beasley2019,
abstract = {Let $m$ and $n$ be positive integers, and let $R = (r_1, \ldots , r_m)$ and $S = (s_1,\ldots , s_n)$ be nonnegative integral vectors. Let $A(R,S)$ be the set of all $m \times 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 \times n$$(0,1)$-matrix, where for each $i$, the $i$th row of $F(R,S)$ consists of $r_i$ 1’s followed by $(n-r_i)$ 0’s. Let $A\in A(R,S)$. The discrepancy of A, $\{\rm 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\times 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.},
author = {Beasley, LeRoy B.},
journal = {Czechoslovak Mathematical Journal},
keywords = {Ferrers matrix; row-dense matrix; discrepancy; linear preserver; strong linear preserver},
language = {eng},
number = {4},
pages = {1123-1131},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {$(0,1)$-matrices, discrepancy and preservers},
url = {http://eudml.org/doc/294867},
volume = {69},
year = {2019},
}

TY - JOUR
AU - Beasley, LeRoy B.
TI - $(0,1)$-matrices, discrepancy and preservers
JO - Czechoslovak Mathematical Journal
PY - 2019
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 69
IS - 4
SP - 1123
EP - 1131
AB - Let $m$ and $n$ be positive integers, and let $R = (r_1, \ldots , r_m)$ and $S = (s_1,\ldots , s_n)$ be nonnegative integral vectors. Let $A(R,S)$ be the set of all $m \times 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 \times n$$(0,1)$-matrix, where for each $i$, the $i$th row of $F(R,S)$ consists of $r_i$ 1’s followed by $(n-r_i)$ 0’s. Let $A\in A(R,S)$. The discrepancy of A, ${\rm 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\times 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.
LA - eng
KW - Ferrers matrix; row-dense matrix; discrepancy; linear preserver; strong linear preserver
UR - http://eudml.org/doc/294867
ER -

References

top
  1. Beasley, L. B., Pullman, N. J., Linear operators preserving properties of graphs, Proc. 20th Southeast Conf. on Combinatorics, Graph Theory, and Computing Congressus Numerantium 70, Utilitas Mathematica Publishing, Winnipeg (1990), 105-112. (1990) Zbl0696.05049MR1041590
  2. Berger, A., The isomorphic version of Brualdies nestedness is in P, 2017, 7 pages, Available at https://arxiv.org/abs/1602.02536v2. 
  3. Berger, A., Schreck, B., 10.3390/a10030074, Algorithms (Basel) 10 (2017), Paper No. 74, 12 pages. (2017) Zbl06916733MR3708470DOI10.3390/a10030074
  4. Brualdi, R. A., Sanderson, G. J., 10.1007/s004420050784, Oecologia 119 (1999), 256-264. (1999) DOI10.1007/s004420050784
  5. Brualdi, R. A., Shen, J., Discrepancy of matrices of zeros and ones, Electron. J. Comb. 6 (1999), Research Paper 15, 12 pages. (1999) Zbl0918.05029MR1674136
  6. Motlaghian, S. M., Armandnejad, A., Hall, F. J., 10.1007/s10587-016-0296-4, Czech. Math. J. 66 (2016), 847-858. (2016) Zbl06644037MR3556871DOI10.1007/s10587-016-0296-4

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.