An $m\times n$ matrix $R$ with nonnegative entries is called row stochastic if the sum of entries on every row of $R$ is 1. Let ${𝐌}_{m,n}$ be the set of all $m\times n$ real matrices. For $A,B\in {𝐌}_{m,n}$, we say that $A$ is row Hadamard majorized by $B$ (denoted by $A{\prec }_{RH}B)$ if there exists an $m\times n$ row stochastic matrix $R$ such that $A=R\circ B$, where $X\circ Y$ is the Hadamard product (entrywise product) of matrices $X,Y\in {𝐌}_{m,n}$. In this paper, we consider the concept of row Hadamard majorization as a relation on ${𝐌}_{m,n}$ and characterize the structure of all linear operators $T:{𝐌}_{m,n}\to {𝐌}_{m,n}$ preserving...

Let ${𝕄}_{n,m}$ be the set of all $n\times m$ real or complex matrices. For $A,B\in {𝕄}_{n,m}$, we say that $A$ is row-sum majorized by $B$ (written as $A{\prec }^{\mathrm{rs}}B$) if $R\left(A\right)\prec R\left(B\right)$, where $R\left(A\right)$ is the row sum vector of $A$ and $\prec$ is the classical majorization on ${ℝ}^n$. In the present paper, the structure of all linear operators $T:{𝕄}_{n,m}\to {𝕄}_{n,m}$ preserving or strongly preserving row-sum majorization is characterized. Also we consider the concepts of even and circulant majorization on ${ℝ}^n$ and then find the linear preservers of row-sum majorization of these relations on ${𝕄}_{n,m}$. ...

For $X,Y\in {𝐌}_{n,m}$ it is said that $X$ is gut-majorized by $Y$, and we write $X{\prec }_{\mathrm{gut}}Y$, if there exists an $n$-by-$n$ upper triangular g-row stochastic matrix $R$ such that $X=RY$. Define the relation ${\sim }_{\mathrm{gut}}$ as follows. $X{\sim }_{\mathrm{gut}}Y$ if $X$ is gut-majorized by $Y$ and $Y$ is gut-majorized by $X$. The (strong) linear preservers of ${\prec }_{\mathrm{gut}}$ on ${ℝ}^n$ and strong linear preservers of this relation on ${𝐌}_{n,m}$ have been characterized before. This paper characterizes all (strong) linear preservers and strong linear preservers of ${\sim }_{\mathrm{gut}}$ on ${ℝ}^n$ and ${𝐌}_{n,m}$.

A $0/1$-simplex is the convex hull of $n+1$ affinely independent vertices of the unit $n$-cube $I^n$. It is nonobtuse if none of its dihedral angles is obtuse, and acute if additionally none of them is right. Acute $0/1$-simplices in $I^n$ can be represented by $0/1$-matrices $P$ of size $n\times n$ whose Gramians $G=P^{\top }P$ have an inverse that is strictly diagonally dominant, with negative off-diagonal entries. In this paper, we will prove that the positive part $D$ of the transposed inverse $P^{-\top }$ of $P$ is doubly stochastic and has the...

In this paper, we consider the linear and circular consecutive $k$-out-of-$n$ systems consisting of arbitrarily dependent components. Under the condition that at least $n-r+1$ components ($r\le n$) of the system are working at time $t$, we study the reliability properties of the residual lifetime of such systems. Also, we present some stochastic ordering properties of residual lifetime of consecutive $k$-out-of-$n$ systems. In the following, we investigate the inactivity time of the component with lifetime...

Let $\varphi$ be a substitution of Pisot type on the alphabet $𝒜=\{1,2,...,d\}$; $\varphi$ satisfies theif for every $i,j\in 𝒜$, there are integers $k,n$ such that ${\varphi }^n\left(i\right)$ and ${\varphi }^n\left(j\right)$ have the same $k$-th letter, and the prefixes of length $k-1$ of ${\varphi }^n\left(i\right)$ and ${\varphi }^n\left(j\right)$ have the same image under the abelianization map. We prove that the strong coincidence condition is satisfied if $d=2$ and provide a partial result for $d\ge 2$.

We prove that, assuming , if $X$ is a space with ${\aleph }_1$-calibre and a zeroset diagonal, then $X$ is submetrizable. This gives a consistent positive answer to the question of Buzyakova in Observations on spaces with zeroset or regular $G_{\delta }$-diagonals, Comment. Math. Univ. Carolin. 46 (2005), no. 3, 469–473. We also make some observations on spaces with ${\aleph }_1$-calibre.

Let $A$, $B$ be $n\times m$ matrices. The concept of matrix majorization means the $j$th column of $A$ is majorized by the $j$th column of $B$ and this is done for all $j$ by a doubly stochastic matrix $D$. We define rc-majorization that extended matrix majorization to columns and rows of matrices. Also, the linear preservers of rc-majorization will be characterized.

Let $m$ and $n$ be positive integers, and let $R=(r_1,...,r_m)$ and $S=(s_1,...,s_n)$ be nonnegative integral vectors. Let $A(R,S)$ be the set of all $m\times n$ $(0,1)$-matrices with row sum vector $R$ and column vector $S$. Let $R$ and $S$ be nonincreasing, and let $F\left(R\right)$ be the $m\times n$ $(0,1)$-matrix, where for each $i$, the $i$th row of $F(R,S)$ consists of $r_i$ 1’s followed by $(n-r_i)$ 0’s. Let $A\in A(R,S)$. The discrepancy of A, $\mathrm{disc}\left(A\right)$, is the number of positions in which $F\left(R\right)$ has a 1 and $A$ has a 0. In this paper we investigate linear operators mapping $m\times n$ matrices over...

A vector $x$ is said to be an eigenvector of a square max-min matrix $A$ if $A\otimes x=x$. An eigenvector $x$ of $A$ is called the greatest $𝐗$-eigenvector of $A$ if $x\in 𝐗=\{x;\underline{x}\le x\le \overline{x}\}$ and $y\le x$ for each eigenvector $y\in 𝐗$. A max-min matrix $A$ is called strongly $𝐗$-robust if the orbit $x,A\otimes x,A^2\otimes x,\cdots$ reaches the greatest $𝐗$-eigenvector with any starting vector of $𝐗$. We suggest an $O\left(n^3\right)$ algorithm for computing the greatest $𝐗$-eigenvector of $A$ and study the strong $𝐗$-robustness. The necessary and sufficient conditions for strong $𝐗$-robustness are introduced...

A vertex $k$-coloring of a graph $G$ is a if $M\left(u\right)\ne M\left(v\right)$ for every edge $uv\in E\left(G\right)$, where $M\left(u\right)$ and $M\left(v\right)$ denote the multisets of colors of the neighbors of $u$ and $v$, respectively. The minimum $k$ for which $G$ has a multiset $k$-coloring is the ${\chi }_m\left(G\right)$ of $G$. For an integer $\ell \ge 0$, the $\ell$- of a graph $G$, ${\mathrm{cor}}^{\ell }\left(G\right)$, is the graph obtained from $G$ by adding, for each vertex $v$ in $G$, $\ell$ new neighbors which are end-vertices. In this paper, the multiset chromatic numbers are determined for $\ell$- of all complete graphs, the regular complete...

Let $T$ be a tree with $n$ vertices. To each edge of $T$ we assign a weight which is a positive definite matrix of some fixed order, say, $s$. Let $D_{ij}$ denote the sum of all the weights lying in the path connecting the vertices $i$ and $j$ of $T$. We now say that $D_{ij}$ is the distance between $i$ and $j$. Define $D:=\left[D_{ij}\right]$, where $D_{ii}$ is the $s\times s$ null matrix and for $i\ne j$, $D_{ij}$ is the distance between $i$ and $j$. Let $G$ be an arbitrary connected weighted graph with $n$ vertices, where each weight is a positive definite matrix of order...