Related papers: The Pascal Matrix, Commuting Tridiagonal Operators…
Symmetrizable matrices are those which are symmetric when multiplied by a diagonal matrix with positive entries. The Cauchy interlace theorem states that the eigenvalues of a real symmetric matrix interlace with those of any principal…
We introduce the triangulant of two matrices, and relate it to the existence of orthogonal eigenvectors. We also use it for a new characterization of mutually unbiased bases. Generalizing the notion, we introduce higher order triangulants…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
We provide a decomposition that is sufficient in showing when a symmetric tridiagonal matrix $A$ is completely positive. Our decomposition can be applied to a wide range of matrices. We give alternate proofs for a number of related results…
We introduce a linear algebraic object called a bidiagonal triple. A bidiagonal triple consists of three diagonalizable linear transformations on a finite-dimensional vector space, each of which acts in a bidiagonal fashion on the…
We present the explicit inverse of a class of symmetric tridiagonal matrices which is almost Toeplitz, except that the first and last diagonal elements are different from the rest. This class of tridiagonal matrices are of special interest…
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…
We develop a self-contained framework for real tridiagonal Toeplitz matrices $A_n(a,b,c)$ (diagonal $b$, subdiagonal $a$, superdiagonal $c$) in the symmetrisable regime $ac>0$. A diagonal similarity transforms $A_n(a,b,c)$ into a symmetric…
A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…
We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…
It is well known that if a matrix $A\in\mathbb C^{n\times n}$ solves the matrix equation $f(A,A^H)=0$, where $f(x, y)$ is a linear bivariate polynomial, then $A$ is normal; $A$ and $A^H$ can be simultaneously reduced in a finite number of…
There is a concept in linear algebra called a tridiagonal pair. The concept was motivated by the theory of $Q$-polynomial distance-regular graphs. We give a tutorial introduction to tridiagonal pairs, working with a special case as a…
The tridiagonal algebra is defined by two generators and two relations, called the tridiagonal relations. Special cases of the tridiagonal algebra include the $q$-Onsager algebra, the positive part of the $q$-deformed enveloping algebra…
We find the spectrum and eigenvectors of an arbitrary irreducible complex tridiagonal matrix with two-periodic main diagonal provided that the spectrum and eigenvectors of the matrix with the same sub- and superdiagonals and zero main…
Tridiagonal canonical forms of square matrices under congruence or *congruence, pairs of symmetric or skew-symmetric matrices under congruence, and pairs of Hermitian matrices under *congruence are given over an algebraically closed field…
We introduce the notion of quadri-algebras. These are associative algebras for which the multiplication can be decomposed as the sum of four operations in a certain coherent manner. We present several examples of quadri-algebras: the…
Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large…
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…
We prove that the algebraic set of pairs of matrices with a diagonal commutator over a field of positive prime characteristic, its irreducible components, and their intersection are $F$-pure when the size of matrices is equal to 3.…
A semi-infinite weighted Hankel matrix with entries defined in terms of basic hypergeometric series is explicitly diagonalized as an operator on $\ell^{2}(\mathbb{N}_{0})$. The approach uses the fact that the operator commutes with a…