Leonard pairs from 24 points of view. (Q1415051)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Leonard pairs from 24 points of view.
scientific article

    Statements

    Leonard pairs from 24 points of view. (English)
    0 references
    3 December 2003
    0 references
    A Leonard pair on a finite-dimensional vector space \(V\) over a field \(\mathbb{K}\) is an ordered pair of linear transformations \(A: V\to V\) and \(A^*: V\to V\) that satisfy the following two conditions. (i) There exists a basis for \(V\) with respect to which the matrix representing \(A\) is diagonal and the matrix representing \(A^*\) is irreducible tridiagonal. (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. The author motivates the theory of Leonard pairs by their connection with certain orthogonal polynomials, and their use in representation theory of some algebras as well as in the theory of \(P\)-polynomial and \(Q\)-polynomial association schemes, a topic in which the author is the expert. See for instance, from the same author [J. Comput. Appl. Math. 153, No. 1--2, 463--475 (2003; Zbl 1035.05103)]. In this quite extensive paper, the author investigates 24 bases for \(V\) on which the action of \(A\) and \(A^*\) take an ``attractive'' (sic) form. The relation between these 24 bases is given by the Cayley graph for the symmetric group \(S_4\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Leonard pair
    0 references
    tridiagonal pair
    0 references
    Askey scheme
    0 references
    Askey-Wilson polynomials
    0 references
    orthogonal polynomials
    0 references
    association schemes
    0 references
    Cayley graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references