Jan 18, 1999 · If S is monotone, the discrepancy d(A) of A is the number of positions in which ¯A has a 1 and A has a 0. It equals the number of 1's in ¯A ...
Feb 10, 1999 · In this paper, we study the minimum and maximum d(A) d ( A ) among all matrices A∈A(R,S) A ∈ A ( R , S ) . We completely solve the minimum ...
... A measure of the 'closeness' of a bipartite network to a nested one is the discrepancy, defined as the number of 1's in the reduced adjacency matrix that ...
Let m and n be positive integers, and let R = (r1,...,rm) and S = (s1,...,sn) be non-negative integral vectors. Let A(R, S) be the set of all.
Discrepancy of matrices of zeros ond ones. Brualdi, Richard A.; Shen, Jian · The Electronic Journal of Combinatorics [electronic only] (1999). Volume: 6, Issue ...
Feb 2, 2019 · A proper set of row-exchangeable pairs is a set of row-exchangeable pairs such that the replacement of each first indexed entry with a 1 and the ...
Aug 30, 2019 · An m × n matrix of zeros and ones is called a Ferrers matrix if it is the reduced adjacency matrix of a nested bipartite network. (From ecology) ...
People also ask
What is a matrix with only 1 and 0?
What is the discrepancy of set systems and matrices?
What is the maximum determinant in a matrix of zeros and ones?
Can a matrix with a row of zeros have an inverse?
Aug 30, 2019 · In this paper we investigate linear operators mapping $m\times n$ matrices over the binary Boolean semiring to itself that preserve sets related ...
Bibliographic details on Discrepancy of Matrices of Zeros and Ones.
Jun 14, 2022 · Abstract. We introduce discrepancy values, quantities inspired by the notion of spectral spread of Hermitian matrices.