Two linear transformations each tridiagonal with respect to an eigenbasis of the other; comments on the parameter array

Mathematics – Rings and Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages

Scientific paper

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy conditions (i), (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 diagonal and the matrix representing $A^*$ is irreducible tridiagonal. We call such a pair a {\it Leonard pair} on $V$. The structure of any given Leonard pair is deterined by a certain sequence of scalars called its {\it parameter array}. The set of parameter arrays is an affine algebraic variety. We give two characterizations of this variety. One involves bidiagonal matrices and the other involves orthogonal polynomials.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Two linear transformations each tridiagonal with respect to an eigenbasis of the other; comments on the parameter array does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two linear transformations each tridiagonal with respect to an eigenbasis of the other; comments on the parameter array, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two linear transformations each tridiagonal with respect to an eigenbasis of the other; comments on the parameter array will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-402149

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.