Related papers: Multiparameter perturbation theory of matrices and…

Let G be a graph of order $n$ with adjacency matrix $A(G)$ and diagonal matrix of degree $D(G)$. For every $\alpha \in [0,1]$, Nikiforov \cite{VN17} defined the matrix $A_\alpha(G) = \alpha D(G) + (1-\alpha)A(G)$. In this paper we present…

In addition to the diagonalization of a normal matrix by a unitary similarity transformation, there are two other types of diagonalization procedures that sometimes arise in quantum theory applications -- the singular value decomposition…

The basic disentanglement theorem established by the present authors states that estimates on a weighted geometric mean over (convex) families of functions can be disentangled into quantitatively linked estimates on each family separately.…

Let $E \ni x\mapsto A(x)$ be a $\mathscr{C}$-mapping with values unbounded normal operators with common domain of definition and compact resolvent. Here $\mathscr{C}$ stands for $C^\infty$, $C^\omega$ (real analytic), $C^{[M]}$…

A cross matrix $X$ can have nonzero elements located only on the main diagonal and the anti-diagonal, so that the sparsity pattern has the shape of a cross. It is shown that $X$ can be factorized into products of matrices that are at most…

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…

Let X be a standard determinantal scheme X \subset \PP^n of codimension c, i.e. a scheme defined by the maximal minors of a t \times (t+c-1) homogeneous polynomial matrix A. In this paper, we study the main features of its normal sheaf…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Statistical inference for stochastic block models typically relies on the spectrum of the normalized adjacency matrix $\A^*$. In practice, the true probability matrix $\mathbf{B}$ is unknown and must be replaced by a plug-in estimator…

Given a function on diagonal matrices, there is a unique way to extend this to an invariant (by conjugation) function on symmetric matrices. We show that the extension preserves regularity -- that is, if the original function is k times…

We construct a commutative algebra A_x of difference operators in R^p, depending on p+3 real parameters which is diagonalized by the multivariable Racah polynomials R_p(n;x) considered by Tratnik [27]. It is shown that for specific values…

In a multiple linear regression model, the algebraic formula of the decomposition theorem explains the relationship between the univariate regression coefficient and partial regression coefficient using geometry. It was found that…

$K$ is an algebraically closed field with characteristic $0$ and $f$ is a polynomial or a holomorphic function. We study all solutions of the equation $XA-AX=f(X)$, in the unknown $X\in M_n(K)$, when $A\in M_n(K)$ is diagonalizable.

Given a non-hermitean matrix M, the structure of its minimal polynomial encodes whether M is diagonalizable or not. This note will explain how to determine the minimal polynomial of a matrix without going through its characteristic…

We introduce the notion of a generalised symmetry M of a hamiltonian H. It is a symmetry which has been broken in a very specific manner, involving ladder operators R and R*. In Theorem 1 these generalised symmetries are characterised in…

Let $\{V_1, \dots, V_n \}$ be a set of mutually commuting matrices. We show that if $V_1^* V_1 + \cdots +V_n^* V_n = {\rm Id}$ then the matrices are normal and, in particular, simultaneously diagonalizable.

The task of analytically diagonalizing a tridiagonal matrix can be considerably simplified when a part of the matrix is uniform. Such quasi-uniform matrices occur in several physical contexts, both classical and quantum, where…

If $A(t)$ is a $C^{1,\al}$-curve of unbounded self-adjoint operators with compact resolvents and common domain of definition, then the eigenvalues can be parameterized $C^1$ in $t$. If $A$ is $C^\infty$ then the eigenvalues can be…

Consider an elliptic self-adjoint pseudodifferential operator $A$ acting on $m$-columns of half-densities on a closed manifold $M$, whose principal symbol is assumed to have simple eigenvalues. Relying on a basis of pseudodifferential…