It is known that a real symmetric circulant matrix with diagonal entries $d\ge 0$, off-diagonal entries $\pm 1$ and orthogonal rows exists only of order $2d+2$ (and trivially of order $1$) [Turek and Goyeneche 2019]. In this paper we consider a complex Hermitian analogy of those matrices. That is, we study the existence and construction of Hermitian circulant matrices having orthogonal rows, diagonal entries $d\ge 0$ and any complex entries of absolute value $1$ off the diagonal. As a particular case, we consider matrices whose...

A matrix $A\in M_n\left(R\right)$ is $e$-clean provided there exists an idempotent $E\in M_n\left(R\right)$ such that $A-E\in {\mathrm{GL}}_n\left(R\right)$ and $detE=e$. We get a general criterion of $e$-cleanness for the matrix $\left[[a_1,a_2,\cdots ,a_{n+1}]\right]$. Under the $n$-stable range condition, it is shown that $\left[[a_1,a_2,\cdots ,a_{n+1}]\right]$ is $0$-clean iff $(a_1,a_2,\cdots ,a_{n+1})=1$. As an application, we prove that the $0$-cleanness and unit-regularity for such $n\times n$ matrix over a Dedekind domain coincide for all $n\ge 3$. The analogous for $(s,2)$ property is also obtained.

This paper extends some properties of the generalized complementary basic matrices, in particular, in a combinatorial direction. These include inheritance (such as for Alternating Sign Matrices), spectral, and sign pattern matrix (including sign nonsingularity) properties.

Let $\left\{X_{ij}\right\}$, $i,j=\cdots$, be a double array of independent and identically distributed (i.i.d.) real random variables with $E{X}_{11}=\mu$, $E|X_{11}{-\mu |}^2=1$ and $E|X_{11}{|}^{4}lt;\infty$. Consider sample covariance matrices (with/without empirical centering) $𝒮=\frac{1}{n}{\sum }_{j=1}^n({𝐬}_j-\overline{𝐬}){({𝐬}_j-\overline{𝐬})}^T$ and $𝐒=\frac{1}{n}{\sum }_{j=1}^n{𝐬}_j{𝐬}_j^T$, where $\overline{𝐬}=\frac{1}{n}{\sum }_{j=1}^n{𝐬}_j$ and ${𝐬}_j={𝐓}_n^{1/2}{(X_{1j},...,X_{pj})}^T$ with ${\left({𝐓}_n^{1/2}\right)}^2={𝐓}_n$, non-random symmetric non-negative definite matrix. It is proved that central limit theorems of eigenvalue statistics of $𝒮$ and $𝐒$ are different as $n\to \infty$ with $p/n$ approaching a positive constant. Moreover, it is also proved that such a different behavior is not observed in the average behavior...

Let A = (aij) ∊ Mn(ℝ) be an n by n symmetric stochastic matrix. For p ∊ [1, ∞) and a metric space (X, dX), let γ(A, dpx) be the infimum over those γ ∊ (0,∞] for which every x1, . . . , xn ∊ X satisfy [...] Thus γ (A, dpx) measures the magnitude of the nonlinear spectral gap of the matrix A with respect to the kernel dpX : X × X →[0,∞). We study pairs of metric spaces (X, dX) and (Y, dY ) for which there exists Ψ: (0,∞)→(0,∞) such that γ (A, dpX) ≤Ψ (A, dpY ) for every symmetric stochastic A ∊ Mn(ℝ)...

Drew, Johnson and Loewy conjectured that for n ≥ 4, the CP-rank of every n × n completely positive real matrix is at most [n2/4]. In this paper, we prove this conjecture for n × n completely positive matrices over Boolean algebras (finite or infinite). In addition,we formulate various CP-rank inequalities of completely positive matrices over special semirings using semiring homomorphisms.

Computing powers of interval matrices is a computationally hard problem. Indeed, it is NP-hard even when the exponent is 3 and the matrices only have interval components in one row and one column. Motivated by this result, we consider special types of interval matrices where the interval components occupy specific positions. We show that computing the third power of matrices with only one column occupied by interval components can be solved in cubic time; so the asymptotic time complexity is the...

We use free probability techniques to compute spectra and Brown measures of some non-hermitian operators in finite von Neumann algebras. Examples include $uₙ+u_{\infty }$ where uₙ and $u_{\infty }$ are the generators of ℤₙ and ℤ respectively, in the free product ℤₙ*ℤ, or elliptic elements of the form $S_{\alpha }+i{S}_{\beta }$ where $S_{\alpha }$ and $S_{\beta }$ are free semicircular elements of variance α and β.

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