All Questions

Consider the following adjacency matrix of a complete graph: $$A=(e^{-|i-j|})_{1\leq i\neq j\leq n}$$ with 0 on the diagonal. Let $D=diag\{d_1,...,d_n\}$ be the degree matrix where $d_i=\sum_{j\neq i}...

Let $M_n$ be an $n\times n$ matrix defined as $$M_n =\left[\frac{2i+1}{2(i+j+1)}\binom{i-1/2}i\binom{j-1/2}jx^{i+j+1}\right]_{i,j=0}^n.$$ With $I_n$ the identity matrix, consider $A_n:=I_n-M_n^2$. ...

I'm looking for an appropriate measure to quantify the extent to which two matrices commute. In other words, if A and B are two n×n Hermitian matrices, and [A,B]=C. I'd like a function μ:Cn×n→[0,∞) ...