Related papers: Tridiagonal real symmetric matrices with a connect…

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 consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$…

For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph…

Trigonometric formulas for eigenvalues of $3 \times 3$ matrices that build on Cardano's and Vi\`ete's work on algebraic solutions of the cubic are numerically unstable for matrices with repeated eigenvalues. This work presents numerically…

We investigate the spectral distribution of random matrix ensembles with correlated entries. We consider symmetric matrices with real valued entries and stochastically independent diagonals. Along the diagonals the entries may be…

We consider real orthogonal $n\times n$ matrices whose diagonal entries are zero and off-diagonal entries nonzero, which we refer to as $\mathrm{OMZD}(n)$. We show that there exists an $\mathrm{OMZD}(n)$ if and only if $n\neq 1,\ 3$, and…

We consider $n\times n$ real-valued matrices $A = (a_{ij})$ satisfying $a_{ii} \geq a_{i,i+1} \geq \dots \geq a_{in} \geq a_{i1} \geq \dots \geq a_{i,i-1}$ for $i = 1,\dots,n$. With such a matrix $A$ we associate a directed graph $G(A)$. We…

We put forward and prove a simple theorem stating that the eigenvalues of a tridiagonal matrix change their sign (as a set), once the signs of the diagonal elements of the matrix are changed. We also provide an example of application of…

It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

In this paper, we define Tribonacci and Tribonacci-Lucas matrix sequences and investigate their properties.

A truncation of a Haar distributed orthogonal random matrix gives rise to a matrix whose eigenvalues are either real or complex conjugate pairs, and are supported within the closed unit disk. This is also true for a product $P_m$ of $m$…

We show that a confluent case of the big q-Jacobi polynomials P_n(x;a,b,c;q), which corresponds to a=b=-c, leads to a discrete orthogonality relation for imaginary values of the parameter a (outside of its commonly known domain 0<a<…

We present a lovely connection between the Fibonacci numbers and the sums of inverses of $(0,1)-$ triangular matrices, namely, a number $S$ is the sum of the entries of the inverse of an $n \times n$ $(n \geq 3)$ $(0,1)-$ triangular matrix…

In this paper we study a generalization of the class of orthogonal polynomials on the real line. These polynomials satisfy the following relation: $(J_5 - \lambda J_3) \vec p(\lambda) = 0$, where $J_3$ is a Jacobi matrix and $J_5$ is a…

We show that in a parametric family of linear recurrence sequences $a_1(\alpha) f_1(\alpha)^n + \ldots + a_k(\alpha) f_k(\alpha)^n$ with the coefficients $a_i$ and characteristic roots $f_i$, $i=1, \ldots,k$, given by rational functions…

A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…

There is a generalized oscillator-like algebra associated with every class of orthogonal polynomials $\{\Psi_n(x)\}_{n=0}^{\infty}$, on the real line, satisfying a four term non-symmetric recurrence relation…

An $n\times n$ matrix $C$ is said to be {\it centrosymmetric} if it satisfies the relation $JCJ=C$, where $J$ is the $n\times n$ counteridentity matrix. Centrosymmetric matrices have a rich eigenstructure that has been studied extensively…

A sign pattern is a matrix that has entries from the set $\{+,-,0\}$. An $n\times n$ sign pattern $\mathcal{P}$ is called consistent if every real matrix in its qualitative class has exactly $k$ real eigenvalues and $n-k$ nonreal…