Tridiagonal matrices with nonnegative entries

From MaRDI portal
Publication:2431166



Abstract: In this paper we characterize the nonnegative irreducible tridiagonal matrices and their permutations, using certain entries in their primitive idempotents. Our main result is summarized as follows. Let d denote a nonnegative integer. Let A denote a matrix in matR and let hii=0d denote the roots of the characteristic polynomial of A. We say A is multiplicity-free whenever these roots are mutually distinct and contained in R. In this case Ei will denote the primitive idempotent of A associated with hi (0leqileqd). We say A is symmetrizable whenever there exists an invertible diagonal matrix DeltainmatR such that DeltaADelta−1 is symmetric. Let Gamma(A) denote the directed graph with vertex set 0,1,...,d, where iightarrowj whenever ieqj and Aijeq0. Theorem: Assume that each entry of A is nonnegative. Then the following are equivalent for 0leqs,tleqd: (i) The graph Gamma(A) is a bidirected path with endpoints s, t: (ii) The matrix A is symmetrizable and multiplicity-free. Moreover the (s,t)-entry of Ei times (hi−h0)...(hi−hi−1)(hi−hi+1)...(hi−hd) is independent of i for 0leqileqd, and this common value is nonzero. Recently Kurihara and Nozaki obtained a theorem that characterizes the Q-polynomial property for symmetric association schemes. We view the above result as a linear algebraic generalization of their theorem.


The authors characterize the nonnegative irreducible tridiagonal matrices and their permutations, using certain entries in their primitive idempotents.











This page was built for publication: Tridiagonal matrices with nonnegative entries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431166)