English
Related papers

Related papers: Remark on the eigenvalues of a tridiagonal matrix …

200 papers

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…

Complex Variables · Mathematics 2021-01-12 Anthony Stefan , Aaron Welters

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…

Probability · Mathematics 2023-02-22 Gérard Ben Arous , Paul Bourgade , Benjamin McKenna

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…

Algebraic Geometry · Mathematics 2022-11-15 Curtis Heberle , Alexander J. Sutherland

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…

Representation Theory · Mathematics 2013-02-22 M. Domokos

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…

Probability · Mathematics 2016-05-05 Kartick Adhikari , Nanda Kishore Reddy , Tulasi Ram Reddy , Koushik Saha

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…

Combinatorics · Mathematics 2011-03-04 Christian Stump

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…

Commutative Algebra · Mathematics 2023-10-09 Rafael Oliveira , Akash Kumar Sengupta

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…

Functional Analysis · Mathematics 2012-06-29 Michal Wojtylak

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…

Differential Geometry · Mathematics 2021-11-11 Supravat Sarkar

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$,…

Classical Analysis and ODEs · Mathematics 2021-05-17 Charles E. Baker , Boris S. Mityagin

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…

Combinatorics · Mathematics 2018-08-22 Shalosh B. Ekhad , Doron Zeilberger

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…

Statistics Theory · Mathematics 2020-01-03 Marco Chiani , Alberto Zanella

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))$…

Data Structures and Algorithms · Computer Science 2025-04-29 Aleksandros Sobczyk

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…

Classical Analysis and ODEs · Mathematics 2022-10-03 Amílcar Branquinho , Ana Foulquié-Moreno , Assil Fradi , Manuel Mañas

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…

Optimization and Control · Mathematics 2013-04-15 Aris Daniilidis , Dmitriy Drusvyatskiy , Adrian S. Lewis

We discuss an algebraic identity, due to Sylvester, as well as related algebraic identities and applications.

Combinatorics · Mathematics 2023-11-17 Bogdan Nica

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…

Numerical Analysis · Mathematics 2016-01-12 Vanni Noferini , Alex Townsend

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…

Numerical Analysis · Mathematics 2012-05-01 Suvrit Sra

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…

High Energy Physics - Theory · Physics 2008-02-03 P. Di Francesco

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…

Combinatorics · Mathematics 2019-04-09 Christoph Koutschan , Thotsaporn Thanatipanonda