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 operators that preserve Boolean rank of Boolean matrices

The Boolean rank of a nonzero m × n Boolean matrix A is the minimum number k such that there exist an m× k Boolean matrix B and a k × n Boolean matrix C such that A = BC. In the previous research L. B. Beasley and N. J. Pullman obtained that a linear operator preserves Boolean rank if and only if it preserves Boolean ranks 1 and 2. In this paper we extend this characterizations of linear operators that preserve the Boolean ranks of Boolean matrices. That is, we obtain that a linear operator preserves Boolean rank if and only if it preserves Boolean ranks 1 and k for some 1 < k ? m.     

Strong linear preservers of rank reverse permutability on triangular matrices

Let F be a field with ∣F∣ > 2 and T_n(F) be the set of all n × n upper triangular matrices, where n ? 2. Let k ? 2 be a given integer. A k-tuple of matrices A₁, …, A_k ∈ T_n(F) is called rank reverse permutable if rank(A₁ A₂ ? A_k) = rank(A_k A_k−1 ? A₁). We characterize the linear maps on T_n(F) that strongly preserve the set of rank reverse permutable matrix k-tuples.     

Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank

Let M_m,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of M_m,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all A∈B(m,n,k) or m=n and T(A)=PA^tQ for all A∈B(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k². Here the weight of a Boolean matrix is the number of its nonzero entries.     

Eigenvalues of the difference and product of projections

There is an isomorphism between the matrices over the Boolean algebra of subsets of a k-element set and the k-tuples of Boolean binary (i.e. zero-one) matrices. This isomorphism allows many problems concerning nonbinary Boolean matrices to the referred to the binary ease. However, there are some features of the general (i.e. nonbinary) case that have not been mentioned, although they differ somewhat from the binary case. We exhibit characterizations of the linear operators that preserve several invariants of matrices over finite Boolean algebras to illustrate the differences and similarities of the general vs. the binary cases. We employ a canonical form that is useful in applying the isomorphism.     

Bijective linear rank preservers for spaces of matrices over antinegative semirings

We classify the bijective linear operators on spaces of matrices over antinegative commutative semirings with no zero divisors which preserve certain rank functions such as the symmetric rank, the factor rank and the tropical rank. We also classify the bijective linear operators on spaces of matrices over the max-plus semiring which preserve the Gondran-Minoux row rank or the Gondran-Minoux column rank.     

Modifiable low‐rank approximation to a matrix

A truncated ULV decomposition (TULVD) of an m×n matrix X of rank k is a decomposition of the form X = ULV^T+E, where U and V are left orthogonal matrices, L is a k×k non‐singular lower triangular matrix, and E is an error matrix. Only U,V, L, and ∥E∥_F are stored, but E is not stored. We propose algorithms for updating and downdating the TULVD. To construct these modification algorithms, we also use a refinement algorithm based upon that in (SIAM J. Matrix Anal. Appl. 2005; 27 (1):198–211) that reduces ∥E∥_F, detects rank degeneracy, corrects it, and sharpens the approximation. Copyright © 2009 John Wiley & Sons, Ltd.     

Linear mappings on symmetry classes of tensors

In this paper we give a survey of results concerning linear mappings on symmetry classes of tensors that preserve decomposable elements and its related topic about linear mappings on spaces of matrices that preserve a fixed rank.     

Linear mappings on symmetry classes of tensors

In this paper we give a survey of results concerning linear mappings on symmetry classes of tensors that preserve decomposable elements and its related topic about linear mappings on spaces of matrices that preserve a fixed rank.     

Linear maps preserving pairs of Hermitian matrices on which the rank is additive and applications

Denote the set ofn×n complex Hermitian matrices byH _n . A pair ofn×n Hermitian matrices (A, B) is said to be rank-additive if rank (A+B)=rankA+rankB. We characterize the linear maps fromH _n into itself that preserve the set of rank-additive pairs. As applications, the linear preservers of adjoint matrix onH _n and the Jordan homomorphisms ofH _n are also given. The analogous problems on the skew Hermitian matrix space are considered.     

Real rank versus nonnegative rank

We consider the set of m×n nonnegative real matrices and define the nonnegative rank of a matrix A to be the minimum k such that A=BC where B is m×k and C is k×n. Given that the real rank of A is j for some j, we give bounds on the nonnegative rank of A and A².     

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.     

A note on linear preservers of certain ranks of tensor products of matrices

In this note, we give a simple proof as well as an extension of a very recent result of B. Zheng, J. Xu and A. Fosner concerning linear maps between vector spaces of complex square matrices that preserve the rank of tensor products of matrices by using a structure theorem of R. Westwick on linear maps between tensor product spaces that preserve non-zero decomposable elements.     

Linear preservers of minimal rank

It is proved that a linear transformation on the vector space of upper triangular matrices that maps the set of matrices of minimal rank 1 into itself, and either has the analogous property with respect to matrices of full minimal rank, or is bijective, is a triangular equivalence, or a flip about the south-west north-east diagonal followed by a triangular equivalence. The result can be regarded as an analogue of Marcus–Moyls theorem in the context of triangular matrices.     

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.     

A comparison of nonnegative real ranks and their preservers

This paper concerns three notions of rank of matrices over semirings; real rank, semiring rank and column rank. These three rank functions are the same over subfields of reals but differ for matrices over subsemirings of nonnegative reals. We investigate the largest values of r for which the real rank and semiring rank, real rank and column rank of all m×n matrices over a given semiring are both r, respectively. We also characterize the linear operators which preserve the column rank of matrices over certain subsemirings of the nonnegative reals.     

Local Bahadur efficiency of rank tests for the independence problem

In previous papers [Approximate and local Bahadur efficiency of linear rank tests in the two-sample problem, Ann. Statist.7, 1246–1255, 1979; Local comparison of linear rank tests in the Bahadur sense, Metrika, 1979] the author developed for linear rank tests of the one-sample symmetry and the k-sample problem (k ≥ 2) a theory of local comparison, based on the concept of Bahadur efficiency. In the present article this theory is carried over to rank tests of the independence problem.     

Existence and Density Theorems for Stochastic Maps on Commutative C*-algebras

This paper presents theoremes on the structure of stochastic and normalized positive linear maps over commutative C*-algebras. We show how strongly the solution of the n-tupel problem for stochastic maps relates to the fact that stochastic maps of finite rank are weakly dense within stochastic maps in case of a commutative C*-algebra. We give a new proof of the density theorem and derive (besides the solution of the n-tupel problem) results concerning the extremal maps of certain convex subsets which are weakly dense. All stated facts suggest application in Statistical Physics (algebraic approach), especially concerning questions around evolution of classical systems.     

Rank-k-preservers and preservers of sets of ranks

Let T be a linear transformation on the set of m × n matrices with entries in an algebraically closed field. If T maps the set of all matrices whose rank is k into itself, and if$\text{n?}\text{3}\text{k}\text{2}$, then the rank of A is the rank of T(A) for every m × n matrix.     

Zero-term rank preservers

We obtain characterizations of those linear operators that preserve zero-term rank on the m×n matrices over antinegative semirings. That is, a linear operator T preserves zero-term rank if and only if it has the form T(X)=P(B∘X)Q, where P, Q are permutation matrices and B∘X is the Schur product with B whose entries are all nonzero and not zero-divisors.