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

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.

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

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 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 $ℛ$ be a commutative ring, $𝒢$ be a generalized matrix algebra over $ℛ$ with weakly loyal bimodule and $𝒵\left(𝒢\right)$ be the center of $𝒢$. Suppose that $𝔮:𝒢\times 𝒢\to 𝒢$ is an $ℛ$-bilinear mapping and that ${𝔗}_{𝔮}:𝒢\to 𝒢$ is a trace of $𝔮$. The aim of this article is to describe the form of ${𝔗}_{𝔮}$ satisfying the centralizing condition $[{𝔗}_{𝔮}\left(x\right),x]\in 𝒵\left(𝒢\right)$ (and commuting condition $[{𝔗}_{𝔮}\left(x\right),x]=0$) for all $x\in 𝒢$. More precisely, we will revisit the question of when the centralizing trace (and commuting trace) ${𝔗}_{𝔮}$ has the so-called proper form from a new perspective. Using the aforementioned...

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

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

Suppose that $A$ is a real symmetric matrix of order $n$. Denote by $m_A\left(0\right)$ the nullity of $A$. For a nonempty subset $\alpha$ of $\{1,2,...,n\}$, let $A\left(\alpha \right)$ be the principal submatrix of $A$ obtained from $A$ by deleting the rows and columns indexed by $\alpha$. When $m_{A\left(\alpha \right)}\left(0\right)=m_A\left(0\right)+\left|\alpha \right|$, we call $\alpha$ a P-set of $A$. It is known that every P-set of $A$ contains at most $\lfloor n/2\rfloor$ elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As...

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

CONTENTS1. Introduction...................................................................................................... 52. Notation and basic terminology........................................................................... 73. Definition and basic properties of the $L_{p,q}$ spaces................................. 114. Integral representation of bounded linear functionals on $L_{p,q}\left(B\right)$........ 235. Examples in $L_{p,q}$ theory...................................................................................

We consider supersymmetric matrix Hamiltonians. The existence of a zero-energy bound state, in particular for the $d=9$ model, is of interest in M-theory. While we do not quite prove its existence, we show that the decay at infinity such a state would have is compatible with normalizability (and hence existence) in $d=9$. Moreover, it would be unique. Other values of $d$, where the situation is somewhat different, shall also be addressed. The analysis is based on a Born-Oppenheimer approximation....

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