Ranges of Sylvester maps and a minimal rank problem.
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.
An matrix with nonnegative entries is called row stochastic if the sum of entries on every row of is 1. Let be the set of all real matrices. For , we say that is row Hadamard majorized by (denoted by if there exists an row stochastic matrix such that , where is the Hadamard product (entrywise product) of matrices . In this paper, we consider the concept of row Hadamard majorization as a relation on and characterize the structure of all linear operators preserving (or...