‎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}$.

‎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}$.

for vectors x, y ∈ rn, it is said that x is left matrix majorizedby y if for some row stochastic matrix r; x = ry. the relationx ∼` y, is defined as follows: x ∼` y if and only if x is leftmatrix majorized by y and y is left matrix majorized by x. alinear operator t : rp → rn is said to be a linear preserver ofa given relation ≺ if x ≺ y on rp implies that t x ≺ ty onrn. the linear preservers o...

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...

A matrix R is said to be g-row substochastic if Re ≤ e. For X, Y ∈ Mn,m, it is said that X is sglt-majorized by Y , X ≺sglt Y , if there exists an n-by-n lower triangular g-row substochastic matrix R such that X = RY . This paper characterizes all (strong) linear preservers and strong linear preservers of ≺sglt on Rn and Mn,m, respectively.

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...

We study linear functions on the space of n × matrices over a field which preserve or strongly each Green's equivalence relations ( L , R H and J ) corresponding pre-orders. For these we are able to completely describe all preservers an algebraically closed (or more generally, in every polynomial degree has root), strong bijective any field. Over general field, non-zero -preservers coincide wit...