Linear preservers of regular matrices over general Boolean algebras.
For a rank-1 matrix over max algebra, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over max algebra. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices if and only if it has the form T(A) = U ⊗ A ⊗ V, or with some monomial matrices U and V.
The set of all Boolean matrices is denoted by . We call a matrix regular if there is a matrix such that . In this paper, we study the problem of characterizing linear operators on that strongly preserve regular matrices. Consequently, we obtain that if , then all operators on strongly preserve regular matrices, and if , then an operator on strongly preserves regular matrices if and only if there are invertible matrices and such that for all , or and for all .
For a rank- matrix , we define the perimeter of as the number of nonzero entries in both and . We characterize the linear operators which preserve the rank and perimeter of rank- matrices over semifields. That is, a linear operator preserves the rank and perimeter of rank- matrices over semifields if and only if it has the form , or with some invertible matrices U and V.
The max algebra consists of the nonnegative real numbers equipped with two binary operations, maximization and multiplication. We characterize the invertible linear operators that preserve the set of commuting pairs of matrices over a subalgebra of max algebra.
We investigate the perimeter of nonnegative integer matrices. We also characterize the linear operators which preserve the rank and perimeter of nonnegative integer matrices. That is, a linear operator preserves the rank and perimeter of rank- matrices if and only if it has the form , or with appropriate permutation matrices and and positive integer matrix , where denotes Hadamard product.
Page 1