On multiplicative (strong) linear preservers of majorizations

Authors

  • Ali Armandnejad Department of Mathematics, Vali-e-Asr University of Rafsanjan, Zip Code: 7718897111, Rafsanjan, Iran.
Abstract:

‎In this paper, we study some kinds of majorizations on $textbf{M}_{n}$ and their linear or strong linear preservers. Also, we find the structure of linear or strong linear preservers which are multiplicative, i.e.  linear or strong linear preservers like $Phi $ with the property $Phi (AB)=Phi (A)Phi (B)$ for every $A,Bin textbf{M}_{n}$.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

on multiplicative (strong) linear preservers of majorizations

‎in this paper, we study some kinds of majorizations on $textbf{m}_{n}$ and their linear or strong linear preservers. also, we find the structure of linear or strong linear preservers which are multiplicative, i.e.  linear or strong linear preservers like $phi $ with the property $phi (ab)=phi (a)phi (b)$ for every $a,bin textbf{m}_{n}$.

full text

9 Some Multiplicative Preservers on B ( H )

In this paper we describe the form of those continuous multiplicative maps on B(H) (H being a separable complex Hilbert space of dimension not less than 3) which preserve the rank, or the corank. Furthermore, we characterize those continuous *-semigroup endomorphisms of B(H) which are spectrum non-increasing.

full text

Linear Preservers of Majorization

For vectors $X, Yin mathbb{R}^{n}$, we say $X$ is left matrix majorized by $Y$ and write $X prec_{ell} Y$ if for some row stochastic matrix $R, ~X=RY.$ Also, we write $Xsim_{ell}Y,$ when $Xprec_{ell}Yprec_{ell}X.$ A linear operator $Tcolon mathbb{R}^{p}to mathbb{R}^{n}$ is said to be a linear preserver of a given relation $prec$ if $Xprec Y$ on $mathbb{R}^{p}$ implies that $TXprec TY$ on $mathb...

full text

The Structure of Strong Linear Preservers of Gw-majorization on M N,m *

Let Mn,m be the set of all n × m matrices with entries in F, where F is the field of real or complex numbers. A matrix R ∈ Mn with the property Re=e, is said to be a g-row stochastic (generalized row stochastic) matrix. Let A,B∈ Mn,m, so B is said to be gw-majorized by A if there exists an n×n g-row stochastic matrix R such that B=RA. In this paper we characterize all linear operators that stro...

full text

Linear Size Distance Preservers

The famous shortest path tree lemma states that, for any node s in a graph G = (V,E), there is a subgraph on O(n) edges that preserves all distances between node pairs in the set {s}×V . A very basic question in distance sketching research, with applications to other problems in the field, is to categorize when else graphs admit sparse subgraphs that preserve distances between a set P of p node...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 03  issue 2

pages  91- 106

publication date 2016-06-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023