Related papers: Remark on the eigenvalues of a tridiagonal matrix …
We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…
We give simple criteria to identify the exponential order of magnitude of the absolute value of the determinant for wide classes of random matrix models, not requiring the assumption of invariance. These include Gaussian matrices with…
For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…
Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate…
We show the density of eigenvalues for three classes of random matrix ensembles is determinantal. First we derive the density of eigenvalues of product of $k$ independent $n\times n$ matrices with i.i.d. complex Gaussian entries with a few…
We connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use this connection to prove that the simplicial complex with k-triangulations as facets is a vertex-decomposable triangulated sphere, and we give a new…
In this paper, we prove the following non-linear generalization of the classical Sylvester-Gallai theorem. Let $\mathbb{K}$ be an algebraically closed field of characteristic $0$, and $\mathcal{F}=\{F_1,\cdots,F_m\} \subset…
Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…
In this article, we shall derive by elementary calculations the Gauss map, spherical image, Weingarten map and the curvatures at identity of the special linear group, that is, the matrices of determinant 1. We could not find any reference…
Fix positive numbers $\alpha$ and $\beta$. For the family of doubly cyclic matrices of the form $diag(a_1, a_2, ... ,a_n) - diag(b_1, b_2, ... ,b_n) \Sigma_*$, where $\Sigma_*$ is a permutation matrix for the $n$-cycle $1 \to 2$, $2 \to 3$,…
We use a "reverse engineering" method, pioneered by George Andrews, to discover an explicit expression for the determinant of a certain tridiagonal matrix discussed by Derrick Henry Lehmer in 1974, that lead to OEIS sequence A039924. Lehmer…
We present some new results on the joint distribution of an arbitrary subset of the ordered eigenvalues of complex Wishart, double Wishart, and Gaussian hermitian random matrices of finite dimensions, using a tensor pseudo-determinant…
In this work we revisit the arithmetic and bit complexity of Hermitian eigenproblems. Recently, [BGVKS, FOCS 2020] proved that a (non-Hermitian) matrix can be diagonalized with a randomized algorithm in $O(n^{\omega}\log^2(n/\epsilon))$…
We consider matrix orthogonal polynomials related to Jacobi type matrices of weights that can be defined in terms of a given matrix Pearson equation. Stating a Riemann-Hilbert problem we can derive first and second order differential…
Orthogonally invariant functions of symmetric matrices often inherit properties from their diagonal restrictions: von Neumann's theorem on matrix norms is an early example. We discuss the example of "identifiability", a common property of…
We discuss an algebraic identity, due to Sylvester, as well as related algebraic identities and applications.
Hidden-variable resultant methods are a class of algorithms for solving multidimensional polynomial rootfinding problems. In two dimensions, when significant care is taken, they are competitive practical rootfinders. However, in higher…
In a very recent paper "\emph{On eigenvalues and equivalent transformation of trigonometric matrices}" (D. Zhang, Z. Lin, and Y. Liu, LAA 436, 71--78 (2012)), the authors motivated and discussed a trigonometric matrix that arises in the…
We prove a determinantal formula for quantities related to the problem of enumeration of (semi-) meanders, namely the topologically inequivalent planar configurations of non-self-intersecting loops crossing a given (half-) line through a…
We evaluate a curious determinant, first mentioned by George Andrews in 1980 in the context of descending plane partitions. Our strategy is to combine the famous Desnanot-Jacobi-Dodgson identity with automated proof techniques. More…