Related papers: Orthosymplectic diagonalization in Williamson's th…

In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…

In this paper we give conditions on a matrix which guarantee that it is similar to a centrosymmetric matrix. We use this conditions to show that some $4 \times 4$ and $6 \times 6$ Toeplitz matrices are similar to centrosymmetric matrices.…

A preconditioning for the Wilson fermion matrix on the lattice is defined which is particularly suited to the case when the temporal lattice spacing is much smaller than the spatial one. Details on the implementation of the scheme are…

We present an Oppenheim type determinantal inequality for positive definite block matrices. Recently, Lin [Linear Algebra Appl. 452 (2014) 1--6] proved a remarkable extension of Oppenheim type inequality for block matrices, which solved a…

It is shown that any symplectic $2n\times 2n$-matrix, whose entries are complex holomorphic functions on a reduced Stein space, can be decomposed into a finite product of elementary symplectic matrices if and only if it is null-homotopic.…

For a 4th order 3-dimensional cyclic symmetric tensor, a sufficient and necessary condition is bulit for its positive semi-definiteness. A sufficient and necessary condition of positive definiteness is showed for a 4th order $n$-dimensional…

In section 1 we give an improved lower bound on Hermite's constant $\delta_{2g}$ for symplectic lattices in even dimensions ($g=2n$) by applying a mean-value argument from the geometry of numbers to a subset of symmetric lattices. Here we…

Let $M_{n}$ denote a random symmetric $n\times n$ matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values $\pm 1$ with probability $1/2$ each). Resolving a conjecture of Vu, we prove that the…

A theorem of Mirsky provides necessary and sufficient conditions for the existence of an N-square complex matrix with prescribed diagonal entries and prescribed eigenvalues. We give a simple inductive proof of this theorem.

In this paper, we prove a necessary and sufficient condition for Tracy-Widom law of Wigner matrices. Consider $N \times N$ symmetric Wigner matrices $H$ with $H_{ij} = N^{-1/2} x_{ij}$, whose upper right entries $x_{ij}$ $(1\le i< j\le N)$…

We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the Hermitian and skew-Hermitian parts of A.

Update: A time-independent $n\times n$ PT-symmetric (and symmetric) Hamiltonian is diagonalizable since it has all distinct real eigenvalues and the resulting diagonal matrix is a real symmetric matrix. The diagonalization results an…

The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…

For a 4th order 3-dimensional symmetric tensor with its some entries $1$ or $-1$, we show the analytic sufficient and necessary conditions of its positive definiteness. By applying these conclusions, several strict inequalities is bulit for…

Let $D$ be an oriented link diagram with the set of regions $\operatorname{r}_{D}$. We define a symmetric map (or matrix) $\operatorname{\tau}_{D}\colon\operatorname{r}_{D}\times \operatorname{r}_{D} \to \mathbb{Z}[x]$ that gives rise to an…

Linear Hamiltonian systems with time-dependent coefficients are of importance to nonlinear Hamiltonian systems, accelerator physics, plasma physics, and quantum physics. It is shown that the solution map of a linear Hamiltonian system with…

A real square matrix is algebraically positive if there exists a real polynomial $f$ such that $f(A)$ is a positive matrix. In this paper, we give a sufficient condition for a sign pattern matrix to allow algebraic positivity, and give some…

For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…

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…

Let $\Omega_n$ denote the class of $n \times n$ doubly stochastic matrices (each such matrix is entrywise nonnegative and every row and column sum is 1). We study the diagonals of matrices in $\Omega_n$. The main question is: which $A \in…