Related papers: Remark on the eigenvalues of a tridiagonal matrix …
This is an introduction to the hyperderminant, according to Gelfand, Kapranov and Zelevinsky. The "triangle inequality", characterizing the Segre varieties such that their dual variety is a hypersurface, is proved in a geometric way…
Determinants of structured matrices play a fundamental role in both pure and applied mathematics, with wide-ranging applications in linear algebra, combinatorics, coding theory, and numerical analysis. In this work, the enumeration of…
In this paper we use the Riemann-Hilbert problem, with jumps supported on appropriate curves in the complex plane, for matrix biorthogonal polynomials and apply it to find Sylvester systems of differential equations for the orthogonal…
In this short note, we present a novel method for computing exact lower and upper bounds of eigenvalues of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and…
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…
The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…
The paper "An efficient sampling scheme for the eigenvalues of dual Wishart matrices", by I.~Santamar\'ia and V.~Elvira, [\emph{IEEE Signal Processing Letters}, vol.~28, pp.~2177--2181, 2021] \cite{SE21}, poses the question of efficient…
Some known results for locating the roots of polynomials are extended to the case of matrix polynomials. In particular, a theorem by A.E. Pellet [Bulletin des Sciences Math\'ematiques, (2), vol 5 (1881), pp.393-395], some results of D.A.…
In this paper we bring to light an unprecedented property of the eigenvalues of a matrix A with the eigenvalues and eigenvectors of a submatrix of A. This property can be used, through the technique developed here, to determine some of…
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…
We introduce numerical characteristics of Sylvester and Hadamard matrices and give their estimates and some of their applications.
Evaluation of the eigenvectors of symmetric tridiagonal matrices is one of the most basic tasks in numerical linear algebra. It is a widely known fact that, in the case of well separated eigenvalues, the eigenvectors can be evaluated with…
We characterize the eigenvalues and eigenvectors of a class of complex valued tridiagonal $n$ by $n$ matrices subject to arbitrary boundary conditions, i.e. with arbitrary elements on the first and last rows of the matrix. %By boundary…
In this paper, we study the limiting distribution of the eigenvalues for random tridiagonal matrix models. The limiting distribution is well described by its moments. Here, an analytical approach allows us, as in the case of Wigner…
Ilse Fischer and the second author introduced in [Algebr. Comb. 7 (2024), no. 5, 1319-1345] a two parameter family of polynomials defined as sums over totally symmetric plane partitions and connected to alternating sign matrices and…
The Householder reduction of a member of the anti-symmetric Gaussian unitary ensemble gives an anti-symmetric tridiagonal matrix with all independent elements. The random variables permit the introduction of a positive parameter $\beta$,…
In this paper, another proof of Pell identities is presented by using the determinant of tridiagonal matrices. It is calculated via the Laplace expansion.
Within the framework of the theory of quaternion column-row determinants and using determinantal representations of the Moore-Penrose inverse previously obtained by the author, we get explicit determinantal representation formulas of…
In this note, we present a systematic method to explicitly compute the determinants and inverses for some generalized Hilbert matrices associated with orthogonal systems with explicit representations. We expressed the determinant, the…
In this paper we consider pentadiagonal $(n+1)\times(n+1)$ matrices with two subdiagonals and two superdiagonals at distances $k$ and $2k$ from the main diagonal where $1\le k<2k\le n$. We give an explicit formula for their determinants and…