195 research outputs found
Linear maps on nonnegative symmetric matrices preserving a given independence number
The independence number of a square matrix , denoted by , is
the maximum order of its principal zero submatrices. Let be the set
of nonnegative symmetric matrices with zero trace, and let be
the matrix with all entries equal to one. Given any integers
with , we prove that a linear map
satisfies and if and only if there is a permutation matrix
such that \phi(X)=P^TXP{~~~~\rm for~ all~}X\in S_n^+.$
Preserver Problems on Matrices
Preserver problems on matrices concern the characterization of linear or nonlinear maps or operators on matrices that preserve properties of the space of matrices or leave certain functions, subsets, and relations invariant. In this talk, I will present some results on both linear and nonlinear preserver problems on matrices
Linear rank preservers of tensor products of rank one matrices
Let be integers larger than or equal to 2. We characterize
linear maps such that
Applying
this result, we extend two recent results on linear maps that preserving the
rank of special classes of matrices.Comment: 12 page
The stable index of digraphs
The stable index of a digraph is defined to be the smallest integer
such that contains two distinct -walks with the same initial vertex
and terminal vertex if such an integer exists; otherwise the stable index of
is defined to be . We characterize the set of stable indices of
digraphs with a given order
Linear preservers and quantum information science
Let be positive integers, the set of complex
matrices and the set of complex matrices. Regard as
the tensor space . Suppose is the Ky Fan -norm
with , or the Schatten -norm with
() on . It is shown that a linear map satisfying for all
and if and only if there are unitary such that
has the form ,
where is either the identity map or the
transposition map . The results are extended to tensor space
of higher level. The connection of the
problem to quantum information science is mentioned.Comment: 13 page
- β¦