Let ${\mathbb{Z}}_{+}$ be the semiring of all nonnegative integers and $A$ an $m\times n$ matrix over ${\mathbb{Z}}_{+}$. The rank of $A$ is the smallest $k$ such that $A$ can be factored as an $m\times k$ matrix times a $k\times n$ matrix. The isolation number of $A$ is the maximum number of nonzero entries in $A$ such that no two are in any row or any column, and no two are in a $2\times 2$ submatrix of all nonzero entries. We have that the isolation number of $A$ is a lower bound of the rank of $A$. For $A$ with isolation number $k$, we investigate the possible values of the...

We introduce the notion of a coherent $P$-ultrafilter on a complete ccc Boolean algebra, strengthening the notion of a $P$-point on $\omega$, and show that these ultrafilters exist generically under $𝔠=𝔡$. This improves the known existence result of Ketonen [On the existence of $P$-points in the Stone-Čech compactification of integers, Fund. Math. 92 (1976), 91–94]. Similarly, the existence theorem of Canjar [On the generic existence of special ultrafilters, Proc. Amer. Math. Soc. 110 (1990), no. 1,...

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

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.

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

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

Let (α) denote the class of all cardinal sequences of length α associated with compact scattered spaces (or equivalently, superatomic Boolean algebras). Also put ${}_{\lambda }\left(\alpha \right)=s\in \left(\alpha \right):s\left(0\right)=\lambda =min\left[s\right(\beta ):\beta <\alpha ]$. We show that f ∈ (α) iff for some natural number n there are infinite cardinals $\lambda ₀i>\lambda ₁>...>{\lambda }_{n-1}$ and ordinals $\alpha ₀,...,{\alpha }_{n-1}$ such that $\alpha =\alpha ₀+\cdots +{\alpha }_{n-1}$ and $f=f₀⏜f₁⏜...⏜f_{n-1}$ where each $f_i{\in }_{{\lambda }_i}\left({\alpha }_i\right)$. Under GCH we prove that if α < ω₂ then (i) ${}_{\omega }\left(\alpha \right)=s{\in }^{\alpha }\omega ,\omega ₁:s\left(0\right)=\omega$; (ii) if λ > cf(λ) = ω, ${}_{\lambda }\left(\alpha \right)=s{\in }^{\alpha }\lambda ,\lambda ⁺:s\left(0\right)=\lambda ,s^{-1}\lambda is\omega ₁-closedin\alpha$; (iii) if cf(λ) = ω₁, ${}_{\lambda }\left(\alpha \right)=s{\in }^{\alpha }\lambda ,\lambda ⁺:s\left(0\right)=\lambda ,s^{-1}\lambda is\omega -closedandsuccessor-closedin\alpha$; (iv) if cf(λ) > ω₁, ${}_{\lambda }\left(\alpha \right){=}^{\alpha }\lambda$. This yields a complete characterization of the classes (α) for all...

We determine when an element in a noncommutative ring is the sum of an idempotent and a radical element that commute. We prove that a $2\times 2$ matrix $A$ over a projective-free ring $R$ is strongly $J$-clean if and only if $A\in J\left(M_2\left(R\right)\right)$, or $I_2-A\in J\left(M_2\left(R\right)\right)$, or $A$ is similar to $\left(\begin{array}{cc}0& \lambda \\ 1& \mu \end{array}\right)$, where $\lambda \in J\left(R\right)$, $\mu \in 1+J\left(R\right)$, and the equation $x^2-x\mu -\lambda =0$ has a root in $J\left(R\right)$ and a root in $1+J\left(R\right)$. We further prove that $f\left(x\right)\in R\left[\right[x\left]\right]$ is strongly $J$-clean if $f\left(0\right)\in R$ be optimally $J$-clean.

For integers $m>r\ge 0$, Brietzke (2008) defined the $(m,r)$-central coefficients of an infinite lower triangular matrix $G=(d,h)={\left(d_{n,k}\right)}_{n,k\in \mathbb{N}}$ as $d_{mn+r,(m-1)n+r}$, with $n=0,1,2,\cdots$, and the $(m,r)$-central coefficient triangle of $G$ as $$G^{(m,r)}={\left(d_{mn+r,(m-1)n+k+r}\right)}_{n,k\in \mathbb{N}}.$$ It is known that the $(m,r)$-central coefficient triangles of any Riordan array are also Riordan arrays. In this paper, for a Riordan array $G=(d,h)$ with $h\left(0\right)=0$ and $d\left(0\right),h^{\text{'}}\left(0\right)\ne 0$, we obtain the generating function of its $(m,r)$-central coefficients and give an explicit representation for the $(m,r)$-central Riordan array $G^{(m,r)}$ in terms of the Riordan array $G$....

A real matrix $A$ is a G-matrix if $A$ is nonsingular and there exist nonsingular diagonal matrices $D_1$ and $D_2$ such that $A^{-\mathrm{T}}=D_{1}A{D}_2$, where $A^{-\mathrm{T}}$ denotes the transpose of the inverse of $A$. Denote by $J=\mathrm{diag}(\pm 1)$ a diagonal (signature) matrix, each of whose diagonal entries is $+1$ or $-1$. A nonsingular real matrix $Q$ is called $J$-orthogonal if $Q^{\mathrm{T}}JQ=J$. Many connections are established between these matrices. In particular, a matrix $A$ is a G-matrix if and only if $A$ is diagonally (with positive diagonals) equivalent to a column permutation...