Linear operators that preserve maximal column rank of boolean matrices

This paper concerns two notions of column rank of matrices over semirings; column rank and maximal column rank. These two notions are the same over fields but differ for matrices over certain semirings. We determine how much the maximal column rank is different from the column ran for all m×n matrices over many semirings. We also characterize the linear operators which preserve the maximal column rank of Boolean matrices.     

Linear operators that preserve pairs of matrices which satisfy extreme rank properties

A pair of m×n matrices (A,B) is called rank-sum-maximal if rank(A+B)=rank(A)+rank(B), and rank-sum-minimal if rank(A+B)=|rank(A)−rank(B)|. We characterize the linear operators that preserve the set of rank-sum-minimal matrix pairs, and the linear operators that preserve the set of rank-sum-maximal matrix pairs over any field with at least min(m,n)+2 elements and of characteristic not 2.     

Linear maps that strongly preserve regular matrices over the Boolean algebra

The set of all m × n Boolean matrices is denoted by $ \mathbb{M} $ \mathbb{M} _m,n . We call a matrix A ∈ $ \mathbb{M} $ \mathbb{M} _m,n regular if there is a matrix G ∈ $ \mathbb{M} $ \mathbb{M} _n,m such that AGA = A. In this paper, we study the problem of characterizing linear operators on $ \mathbb{M} $ \mathbb{M} _m,n that strongly preserve regular matrices. Consequently, we obtain that if min{m, n} ⩽ 2, then all operators on $ \mathbb{M} $ \mathbb{M} _m,n strongly preserve regular matrices, and if min{m, n} ⩾ 3, then an operator T on $ \mathbb{M} $ \mathbb{M} _m,n strongly preserves regular matrices if and only if there are invertible matrices U and V such that T(X) = UXV for all X ε $ \mathbb{M} $ \mathbb{M} _m,n , or m = n and T(X) = UX ^T V for all X ∈ $ \mathbb{M} $ \mathbb{M} _n .     

Linear operators that preserve maximal column ranks of nonnegative integer matrices

The maximal column rank of an by matrix over a semiring is the maximal number of the columns of which are linearly independent. We characterize the linear operators which preserve the maximal column ranks of nonnegative integer matrices.

     

Linear maps that preserve commuting pairs of matrices

Let L be a linear map on the space of n by n matrices with entries in an algebraically closed field of characteristic 0. In this article we characterize all non-singular L with the property that AB = BA implies L(A)L(B) = L(B)L(A).     

Linear transformations on symmetric matrices that preserve commutativity

It is shown that if a nonsingular linear transformation T on the space of n-square real symmetric matrices preserves the commutativity, where n ?3, then T(A) = λQAQ^t + Q(A)I_n for all symmetric matricesA, for some scalar λ, orthogonal matrix Q, and linear functional Q.     

Linear maps that preserve singular and nonsingular matrices

Let M (n,K) be the algebra of n × n matrices over an algebraically closed field K and T:M (n,K)→M (n,K) a linear transformation with the property that T maps nonsingular (singular) matrices to nonsingular (singular) matrices. Using some elementary facts from commutative algebra we show that T is nonsingular and maps singular matrices to singular matrices (T is nonsingular or T maps all matrices to singular matrices). Using these results we obtain Marcus and Moyl's characterization [T(x) = UXVorU^tXV for fixed U and V] from a result of Dieudonné's. Examples are given to show the hypothesis of algebraic closure in necessary.     

Linear transformations that preserve certain positivity classes of matrices

For each of several S ? R^n,n, those linear transformations $\text{L}\text{: R}{}^{\mathrm{n,n}}\text{→ R}{}^{\mathrm{n,n}}$ which map S onto S are characterized. Each class is a familiar one which generalizes the notion of positivity to matrices. The classes include: the matrices with nonnegative principal minors, the M-matrices, the totally nonnegative matrices, the D-stable matrices, the matrices with positive diagonal Lyapunov solutions, and the H-matrices, as well as other related classes. The set of transformations is somewhat different from case to case, but the strategy of proof, while differing in detail, is similar.     

Linear transformations on symmetric matrices that preserve the permanent

It is shown that if a linear transformation T on the space of n-square symmetric matrices over any subfield of the real field preserves the permanent, where n ? 3, then T(A)= ± PAP^t for all symmetric matrices A and a fixed generalized permutation matrix P with per P= ± 1.     

Linear maps that preserve matrices annihilated by a polynomial

Let M_n be the algebra of n×n matrices over an algebraically closed field of characteristic zero. Let f(x) be a polynomial over $\text{F}$ with at least two distinct roots. Then all nonsingular linear maps L:M_n→M_n that map matrix roots of F(x)=0 into matrix roots of f(x}=0 are found.     

Term rank preservers of Boolean matrices

We obtain some characterizations of linear operators that preserve the term rank of Boolean matrices. That is, a linear operator over Boolean matrices preserves the term rank if and only if it preserves the term ranks 1 and k(≠1) if and only if it preserves the term ranks 2 and l(≠2). Other characterizations of term rank preservers are given.     

Linear transformations which preserve fixed rank

Let M_{m, n}(F) denote the set of all m×n matrices over the algebraically closed field F. Let T denote a linear transformation, T:M_{m, n}(F)→M_{m, n}(F). Theorem: If max(m, n)?2k?2, k?1, and T preserves rank k matrices [i.e.?(A)=k implies ?(T(A))=k], then there exist nonsingular m×m and n×n matrices U and V respectively such that either (i) T:A→UAV for all A?M_{m, n}(F), or (ii) m=n and T:A→UA^tV for all A?M_n(F), where A^t denotes the transpose of A.     

Linear operators preserving correlation matrices

The linear operators that map the set of real or complex (rank one) correlation matrices onto itself are characterized.

     

The primitive Boolean matrices with the second largest scrambling index by Boolean rank

The scrambling index of an n × n primitive Boolean matrix A is the smallest positive integer k such that A ^k (A ^T) ^k = J, where A ^T denotes the transpose of A and J denotes the n×n all ones matrix. For an m×n Boolean matrix M, its Boolean rank b(M) is the smallest positive integer b such that M = AB for some m × b Boolean matrix A and b×n Boolean matrix B. In 2009, M. Akelbek, S. Fital, and J. Shen gave an upper bound on the scrambling index of an n×n primitive matrix M in terms of its Boolean rank b(M), and they also characterized all primitive matrices that achieve the upper bound. In this paper, we characterize primitive Boolean matrices that achieve the second largest scrambling index in terms of their Boolean rank.     

Maps on matrices that preserve the spectrum

Let T be a continuous map of the space of complex n×n matrices into itself satisfying T(0)=0 such that the spectrum of T(x)-T(y) is always a subset of the spectrum of x-y. There exists then an invertible n×n matrix u such that either T(a)=uau^-1 for all a or T(a)=ua^tu^-1 for all a. We arrive at the same conclusion by supposing that the spectrum of x-y is always a subset of the spectrum of T(x)-Tt(y), without the continuity assumption on T.     

On extremal matrices of second largest exponent by Boolean rank

Let b = b(A) be the Boolean rank of an n × n primitive Boolean matrix A and exp(A) be the exponent of A. Then exp(A) ? (b − 1)² + 2, and the matrices for which equality occurs have been determined in [D.A. Gregory, S.J. Kirkland, N.J. Pullman, A bound on the exponent of a primitive matrix using Boolean rank, Linear Algebra Appl. 217 (1995) 101-116]. In this paper, we show that for each 3 ? b ? n − 1, there are n × n primitive Boolean matrices A with b(A) = b such that exp(A) = (b − 1)² + 1, and we explicitly describe all such matrices.     

On linear operators strongly preserving invariants of Boolean matrices

Let U _k be the general Boolean algebra and T a linear operator on M _m,n (U _k ). If for any A in M _m,n (U _k ) (M _n (U _k ), respectively), A is regular (invertible, respectively) if and only if T(A) is regular (invertible, respectively), then T is said to strongly preserve regular (invertible, respectively) matrices. In this paper, we will give complete characterizations of the linear operators that strongly preserve regular (invertible, respectively) matrices over U _k . Meanwhile, noting that a general Boolean algebra U _k is isomorphic to a finite direct product of binary Boolean algebras, we also give some characterizations of linear operators that strongly preserve regular (invertible, respectively) matrices over 169-7 _k from another point of view.