Related papers: On the singular values of matrices with displaceme…
We consider Kac's random walk on $n$-dimensional rotation matrices, where each step is a random rotation in the plane generated by two randomly picked coordinates. We show that this process converges to the Haar measure on $\mathit{SO}(n)$…
We summarize significant classical results on (in)determinacy of measures in terms of their finite positive integer order moments. Well-known is the role of the smallest eigenvalues of Hankel matrices, starting from Hamburger's results a…
Complex Hermitian random matrices with a unitary symmetry can be distinguished by a weight function. When this is even, it is a known result that the distribution of the singular values can be decomposed as the superposition of two…
We introduce a general method for transforming the equations of motion following from a Das-Jevicki-Sakita Hamiltonian, with boundary conditions, into a boundary value problem in one-dimensional quantum mechanics. For the particular case of…
We characterize the relationship between the singular values of a complex Hermitian (resp., real symmetric, complex symmetric) matrix and the singular values of its off-diagonal block. We also characterize the eigenvalues of an Hermitian…
We draw attention to the fact that a Hermitian matrix is always diagonalizable and has real discrete spectrum whereas the Hermitian Schr{\"o}dinger Hamiltonian: $H=p^2/2\mu+V(x)$, may not be so. For instance when $V(x)=x, x^3, -x^2$, $H$…
Let $X$ be a complex manifold and let $g$ be a polyhedral metric on it inducing its topology. We say that $g$ is a polyhedral K\"ahler (PK) metric on $X$ if it is K\"ahler outside its singular set. The local geometry of PK metrics is…
We consider random matrices of the form $H = W + \lambda V$, $\lambda\in\mathbb{R}^+$, where $W$ is a real symmetric or complex Hermitian Wigner matrix of size $N$ and $V$ is a real bounded diagonal random matrix of size $N$ with i.i.d.\…
For complex $\rho$, the spectral properties of the Toeplitz matrix $K_{n}(\rho)=\left[\rho^{|j-k|}\right]_{j,k=1}^{n}$, often called the Kac-Murdock-Szeg{\omicron} matrix, have been examined in detail in two recent papers. The second paper,…
A finite dimensional quantum mechanical system is modeled by a density rho, a trace one, positive semi-definite matrix on a suitable tensor product space H[N] . For the system to demonstrate experimentally certain non-classical behavior,…
We extend Halphen's theorem which characterizes the solutions of certain $n$th-order differential equations with rational coefficients and meromorphic fundamental systems to a first-order $n \times n$ system of differential equations. As an…
For a general class of large non-Hermitian random block matrices $\mathbf{X}$ we prove that there are no eigenvalues away from a deterministic set with very high probability. This set is obtained from the Dyson equation of the Hermitization…
We give a new explicit construction of $n\times N$ matrices satisfying the Restricted Isometry Property (RIP). Namely, for some c>0, large N and any n satisfying N^{1-c} < n < N, we construct RIP matrices of order k^{1/2+c}. This overcomes…
For bound states of atoms and molecules of $N$ electrons we consider the corresponding $K$-particle reduced density matrices, $\Gamma^{(K)}$, for $1 \le K \le N-1$. Previously, eigenvalue bounds were obtained in the case of $K=1$ and…
The completion of matrices with missing values under the rank constraint is a non-convex optimization problem. A popular convex relaxation is based on minimization of the nuclear norm (sum of singular values) of the matrix. For this…
The singular value decomposition of a complex matrix is a fundamental concept in linear algebra and has proved extremely useful in many subjects. It is less clear what the situation is over a finite field. In this paper, we classify the…
In this paper, we analyse singular values of a large $p\times n$ data matrix $\mathbf{X}_n= (\mathbf{x}_{n1},\ldots,\mathbf{x}_{nn})$ where the column $\mathbf{x}_{nj}$'s are independent $p$-dimensional vectors, possibly with different…
The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main result is that, for binary matrices, there is a complexity…
In this paper, we provide a structure theorem and various characterizations of degradable strongly entanglement breaking maps on separable Hilbert spaces. In the finite dimensional case, we prove that unital degradable entanglement breaking…
A successful computational approach for solving large-scale positive semidefinite (PSD) programs is to enforce PSD-ness on only a collection of submatrices. For our study, we let $\mathcal{S}^{n,k}$ be the convex cone of $n\times n$…