Related papers: Remark on the eigenvalues of a tridiagonal matrix …
A square matrix is $k$-Toeplitz if its diagonals are periodic sequences of period $k$. We find universal formulas for the determinant, the characteristic polynomial, some eigenvectors, and the entries of the inverse of any tridiagonal…
This preprint is the introduction of my habilitation thesis for Paris7 university. It is a sumary of a collection of works on the 2 matrix model. In an introduction, 3 different and unequivalent definitions of matrix models are given…
Docovic and Szechtman, [Proc. Amer. Math. Soc. 133 (2005) 2853-2863] considered a vector space V endowed with a bilinear form. They proved that all isometries of V over a field F of characteristic not 2 have determinant 1 if and only if V…
A straightforward model for deposition and evaporation on discrete cells of a finite array of any dimension leads to a matrix equation involving a Sylvester-Kac type matrix. The eigenvalues and eigenvectors of the general matrix are…
In this note we prove an assertion made by M. Levin in 1999: the Pascal matrix modulo 2 has the property that each of the square sub-matrices laying on the upper border or on the left border has determinants, computed in $\mathbb{Z}$, equal…
For any three $\,n\times n\,$ matrices $\,A,B,X\,$ over a commutative ring $\,S$, we prove that $\,{\rm det}\,(A+B-AXB)={\rm det}\,(A+B-BXA) \in S$. This apparently new formula may be regarded as a ``ternary generalization'' of Sylvester's…
We consider the convolution equation $F*X=B$, where $F\in\mathbb{R}^{3\times 3}$ and $B\in\mathbb{R}^{m\times n}$ are given, and $X\in\mathbb{R}^{m\times n}$ is to be determined. The convolution equation can be regarded as a linear system…
Given two $\left( n+1\right) \times\left( n+1\right)$-matrices $A$ and $B$ over a commutative ring, and some $k\in\left\{ 0,1,\ldots,n\right\}$, we consider the $\dbinom{n}{k}\times\dbinom{n}{k}$-matrix $W$ whose entries are $\left(…
We consider several extensions of the Maillet determinant studied by Malo, Turnbull, and Carlitz and Olson, and derive properties of the underlying matrices. In particular, we compute the eigenvectors and eigenvalues of these matrices,…
Eigenvectors associated with non-degenerate eigenvalues are shown to correspond to columns of the adjugate of the characteristic matrix. Degenerate eigenvalues are associated with eigenvectors that correspond to reduced complement tensors…
We prove, in the case of hyperbolic 3-space, a couple of conjectures raised by J. J. Seidel in "On the volume of a hyperbolic simplex", Stud. Sci. Math. Hung. 21, 243-249, 1986. These conjectures concern expressing the volume of an ideal…
We consider square matrices over $\mathbb{C}$ satisfying an identity relating their eigenvalues and the corresponding eigenvectors re-proved and discussed by Denton, Parker, Tao and Zhang, called the eigenvector-eigenvalue identity. We…
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…
A general method of finding functional determinants is presented that depends on the asymptotic behaviour of the resolvent. Its application to the case of a bounded trihedral corner for which the eigenvalues are known only implicitly is…
In this paper we are concerned to find the eigenvalues and eigenvectors of a real symetric matrix by applying a new numerical method similar to Jacobi method. Our approch consists to use a new orthogonal matrix. The computation of the…
We prove that semialgebraic sets of rectangular matrices of a fixed rank, of skew-symmetric matrices of a fixed rank and of real symmetric matrices whose eigenvalues have prescribed multiplicities are minimal submanifolds of the space of…
Let $\mathcal{A}$ be a unital complex semisimple Banach algebra, and $M_{\mathcal{A}}$ denote its maximal ideal space. For a matrix $M\in {\mathcal{A}}^{n\times n}$, $\widehat{M}$ denotes the matrix obtained by taking entry-wise Gelfand…
Generalizing work from the 1970s on the determinants of distance hypermatrices of trees, we consider the hyperdeterminants of order-$k$ Steiner distance hypermatrices of trees on $n$ vertices. We show that they can be nearly diagonalized as…
A generalized eigenvalue algorithm for tridiagonal matrix pencils is presented. The algorithm appears as the time evolution equation of a nonautonomous discrete integrable system associated with a polynomial sequence which has some…
Conditionally on the Riemann hypothesis for certain Dedekind zeta functions, we show that the characteristic polynomial of a class of random tridiagonal matrices of large dimension is irreducible, with probability exponentially close to…