On linear preservers of semipositive matrices

Given proper cones $K_1$ and $K_2$ in $\mathbb{R}^n$ and $\mathbb{R}^m$, respectively, an $m \times n$ matrix $A$ with real entries is said to be semipositive if there exists a $x \in K_1^{\circ}$ such that $Ax \in K_2^{\circ}$, where $K^{\circ}$ denotes the interior of a proper cone $K$. This set is denoted by $S(K_1,K_2)$. We resolve a recent conjecture on the structure of into linear preservers of $S(\mathbb{R}^n_+,\mathbb{R}^m_+)$. We also determine linear preservers of the set $S(K_1,K_2)$ for arbitrary proper cones $K_1$ and $K_2$. Preservers of the subclass of those elements of $S(K_1,K_2)$ with a $(K_2,K_1)$-nonnegative left inverse as well as connections between strong linear preservers of $S(K_1,K_2)$ with other linear preserver problems are considered.

Bounded linear operators that preserve the weak supermajorization on $\ell^1(I)^+$

Linear preservers of weak supermajorization which is defined on positive functions contained in the discrete Lebesgue space $\ell^1(I)$ are characterized. Two different classes of operators that preserve the weak supermajorization are formed. It is shown that every linear preserver may be decomposed as sum of two operators from the above classes, and conversely, the sum of two operators which satisfy an additional condition is a linear preserver. Necessary and sufficient conditions under which a bounded linear operator is a linear preserver of the weak supermajorization are given. It is concluded that positive linear preservers of the weak supermajorization coincide with preservers of weak majorization and standard majorization on $\ell^1(I)$.

Two linear preserver problems on graphs

Let n, t, k be integers such that 3 ≤ t,k ≤ n. Denote by G_n the set of graphs with vertex set {1,2,...,n}. In this paper, the complete linear transformations on G_n mapping K_t-free graphs to K_t-free graphs are characterized. The complete linear transformations on G_n mapping C_k-free graphs to C_k-free graphs are also characterized when n ≥ 6.