相关论文: Symplectic eigenvalues of positive-semidefinite ma…

We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…

The main result of the paper gives criteria for extendibility of sesquilinear form-valued mappings defined on symmetric subsets of *-semigroups to positive definite ones. By specifying this we obtain new solutions of: * the truncated…

A reduction of the transmission eigenvalue problem for multiplicative sign-definite perturbations of elliptic operators with constant coefficients to an eigenvalue problem for a non-selfadjoint compact operator is given. Sufficient…

We provide characterizations of continuous eigenvalues for minimal symbolic dynamical systems described by $S$-adic structures satisfying natural mild conditions, such as recognizability and primitiveness. Under the additional assumptions…

We analyze the asymptotic fluctuations of linear eigenvalue statistics of random centrosymmetric matrices with i.i.d. entries. We prove that for a complex analytic test function, the centered and normalized linear eigenvalue statistics of…

We characterize the mixed discriminant of positive semi definite matrices using its most basic properties. As a corollary we establish its minimality among non negative and multi additive functionals.

We use symbolic expressions for traces of positive integer powers of a Hermitian operator (or, equivalently, coefficients of corresponding characteristic polynomial) to find solutions for the problems as follows: Factorization of…

Symmetries are known to dictate important physical properties and can be used as a design principle in particular in wave physics, including wave structures and the resulting propagation dynamics. Local symmetries, in the sense of a…

In this article, we obtain some results in the direction of ``infinite dimensional symplectic spectral theory". We prove an inequality between the eigenvalues and symplectic eigenvalues of a special class of infinite dimensional operators.…

We present a new approach to compute eigenvalues and eigenvectors of locally definite multiparameter eigenvalue problems by its signed multiindex. The method has the interpretation of a semismooth Newton method applied to certain functions…

We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay…

A basic problem in linear particle optics is to find a symplectic transformation that brings the (symmetric) beam matrix to a special diagonal form, called normal form. The conventional way to do this involves an eigenvalue-decomposition of…

We consider the class of non-Hermitian operators represented by infinite tridiagonal matrices, selfadjoint in an indefinite inner product space with one negative square. We approximate them with their finite truncations. Both infinite and…

We develop the symplectic elimnation algorithm. This algorithm using simple row operations reduce a symplectic matrix to a diagonal matrix. This algorithm gives rise to a decomposition of an arbitrary matrix into a product of a symplectic…

Given a random quantum state of multiple distinguishable or indistinguishable particles, we provide an effective method, rooted in symplectic geometry, to compute the joint probability distribution of the eigenvalues of its one-body reduced…

We present randomized algorithms for estimating the trace and deter- minant of Hermitian positive semi-definite matrices. The algorithms are based on subspace iteration, and access the matrix only through matrix vector products. We analyse…

It is well-known that a symmetric matrix with its entries $\pm1$ is not positive definite. But this is not ture for symmetric tensors (hyper-matrix). In this paper, we mainly dicuss the positive (semi-)definiteness criterion of a class of…

The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$, is denoted by $q(G)$. Using other parameters related to $G$, bounds for $q(G)$ are proven and then applied to deduce…

Motivated by a work of Fu-So-Song, we associate a symmetric matrix $A$ to a plane vector sequence $v$ and give a formula to find the signature of $A$ in terms of the sequence $v$. When $A$ is nonsingular, we interpret the relation between…

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…