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.

Let P ∈ ℂmxm and Q ∈ ℂn×n be invertible matrices partitioned as P = [P0 P1 · · · Pk−1] and Q = [Q0 Q1 · · · Qk−1], with P ℓ ∈ ℂm×mℓ and Qℓ ∈ ℂn×nℓ , 0 ≤ ℓ ≤ k − 1. Partition P−1 and Q−1 as [...] where P̂ℓ ∈ ℂmℓ ×m, Q̂ℓ ∈ ℂnℓ×n , P̂ℓPm = δℓmImℓ , and Q̂ℓQm = δℓmInℓ , 0 ≤ ℓ, m ≤ k − 1. Let Zk = {0, 1, . . . , k − 1}. We study matrices A = [...] Pσ(ℓ)FℓQℓ and B = [...] QℓGℓPσ(ℓ), where σ : Zk → Zk. Special cases: A = [...] and B = [...] , where Aℓ ∈ ℂd1×d2 and Bℓ ∈ ℂd2×d1, 0 ≤ ℓ ≤ k − 1.

We give some sufficient and necessary conditions for an element in a ring to be an EP element, partial isometry, normal EP element and strongly EP element by using solutions of certain equations.

We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state-space representation. We put particular emphasis on two classes of inverses: the weak generalized inverse and the Moore-Penrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computational ingredient to determine generalized inverses is the orthogonal reduction of the system matrix pencil...

A tree is classified as being type I provided that there are two or more Perron branches at its characteristic vertex. The question arises as to how one might construct such a tree in which the Perron branches at the characteristic vertex are not isomorphic. Motivated by an example of Grone and Merris, we produce a large class of such trees, and show how to construct others from them. We also investigate some of the properties of a subclass of these trees. Throughout, we exploit connections between...