Related papers: Orthosymplectic diagonalization in Williamson's th…
Some new characterizations of nonnegative Hamiltonian operator matrices are given. Several necessary and sufficient conditions for an unbounded nonnegative Hamiltonian operators to be invertible are obtained; so that the main results in the…
We prove that given four arbitrary quaternion numbers of norm 1 there always exists a $2\times 2$ symplectic matrix for which those numbers are left eigenvalues. The proof is constructive. An application to the LS category of Lie groups is…
A matrix $A\in\mathbb{C}^{n\times n}$ is diagonalizable if it has a basis of linearly independent eigenvectors. Since the set of nondiagonalizable matrices has measure zero, every $A\in \mathbb{C}^{n\times n}$ is the limit of diagonalizable…
Sinkhorn proved that every entry-wise positive matrix can be made doubly stochastic by multiplying with two diagonal matrices. In this note we prove a recently conjectured analogue for unitary matrices: every unitary can be decomposed into…
The deterministic switching of magnetic order parameters is critically important, as it forms the fundamental basis for manipulating information states in magnetic memory devices. This work presents a general theoretical framework that…
A new, recursive method of calculating matrix elements of polynomial hamiltonians is proposed. It is particularly suitable for the recent algebraic studies of the supersymmetric Yang-Mills quantum mechanics in any dimensions. For the D=2…
Orthostochastic matrices are the entrywise squares of orthogonal matrices, and naturally arise in various contexts, including notably definite symmetric determinantal representations of real polynomials. However, defining equations for the…
The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…
We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…
Let $R$ be a finite commutative ring with identity. In this paper, we give a necessary condition for the existence of an orthogonal decomposition of the special linear Lie algebra over $R$. Additionally, we study orthogonal decompositions…
We define a special matrix multiplication among a special subset of $2N\x 2N$ matrices, and study the resulting (non-associative) algebras and their subalgebras. We derive the conditions under which these algebras become alternative…
We establish several sufficient conditions for the strong ellipticity of any fourth-order elasticity tensor in this paper. The first presented sufficient condition is an extension of positive definite matrices, which states that the strong…
We prove that the following statements are equivalent: a linear matrix equation with parameters forming a commuting set of diagonalizable matrices is consistent, a certain matrix constructed with the Drazin inverse is a solution of this…
The infinite matrices in Witten's vertex are easy to diagonalize. It just requires some SL(2,R) lore plus a Watson-Sommerfeld transformation. We calculate the eigenvalues of all Neumann matrices for all scale dimensions s, both for matter…
We prove a normal form theorem for Poisson structures around Poisson transversals (also called cosymplectic submanifolds), which simultaneously generalizes Weinstein's symplectic neighborhood theorem from symplectic geometry and Weinstein's…
The two-by-two Sp(2) matrix has three parameters with unit determinant. Yet, there are no established procedures for diagonalizing this matrix. It is shown that this matrix can be written as a similarity transformation of the two-by-two…
We consider the matrix completion problem with a deterministic pattern of observed entries. In this setting, we aim to answer the question: under what condition there will be (at least locally) unique solution to the matrix completion…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
A determinantal approximation is obtained for the permanent of a doubly stochastic matrix. For moderate-deviation matrix sequences, the asymptotic relative error is of order $O(n^{-1})$.
We show, using a hybrid analysis/linear algebra argument, that the diagonal vector of an infinite symmetric matrix over ${\mathbb Z}_2$ is contained in the range of the matrix. We apply this result to an extension, to the countable infinite…