A characterization of bipartite Leonard pairs using the notion of a tail

preprint2013arXivOpen access

Abstract

Let VV denote a vector space with finite positive dimension. We consider an ordered pair of linear transformations A:V→VA: V\rightarrow V and A∗:V→VA^*: V\rightarrow V that satisfy (i) and (ii) below. (i) There exists a basis for VV with respect to which the matrix representing AA is irreducible tridiagonal and the matrix representing A∗A^* is diagonal. (ii) There exists a basis for VV with respect to which the matrix representing A∗A^* is irreducible tridiagonal and the matrix representing AA is diagonal. We call such a pair a Leonard pair on VV. Very roughly speaking, a Leonard pair is a linear algebraic abstraction of a QQ-polynomial distance-regular graph. There is a well-known class of distance-regular graphs said to be bipartite and there is a related notion of a bipartite Leonard pair. Recently, M. S. Lang introduced the notion of a tail for bipartite distance-regular graphs, and there is an abstract version of this tail notion. Lang characterized the bipartite QQ-polynomial distance-regular graphs using tails. In this paper, we obtain a similar characterization of the bipartite Leonard pairs using tails. Whereas Lang's arguments relied on the combinatorics of a distance-regular graph, our results are purely algebraic in nature.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.