A characterization of Leonard pairs using the notion of a tail

From MaRDI portal
Publication:636261

DOI10.1016/J.LAA.2011.05.009zbMATH Open1232.15002arXiv0911.0098OpenAlexW2085550721MaRDI QIDQ636261FDOQ636261


Authors: Edward Hanson Edit this on Wikidata


Publication date: 26 August 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Let V denote a vector space with finite positive dimension. We consider an ordered pair of linear transformations A:VoV and A:VoV that satisfy (i) and (ii) below: (i) There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A is diagonal. (ii) There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A is diagonal. We call such a pair a Leonard pair on V. In this paper, we characterize the Leonard pairs using the notion of a tail. This notion is borrowed from algebraic graph theory.


Full work available at URL: https://arxiv.org/abs/0911.0098




Recommendations




Cites Work


Cited In (12)





This page was built for publication: A characterization of Leonard pairs using the notion of a tail

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