Parameters of association schemes that are both P- and Q-polynomial (Q789391)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parameters of association schemes that are both P- and Q-polynomial
scientific article

    Statements

    Parameters of association schemes that are both P- and Q-polynomial (English)
    0 references
    0 references
    1984
    0 references
    This paper contains the original proof (recursive in nature) that all the parameters and eigenvalues of a P- and Q-polynomial association scheme are determined by only the integer parameters \(b_ 0\), \(b_ 1\), \(b_ 2\), and \(c_ 2\) together with the first eigenvalue \(\theta_ 1\) and its multiplicity, independent of the number of classes in the scheme (thus facilitating the characterization of such schemes). More recent work by the author [SIAM J. Math. Anal. 13, 656-663 (1982; Zbl 0495.33006)] characterizing the Askey-Wilson orthogonal polynomials, gave a closed form for all the parameters and eigenvalues in terms of nine complex variables. This has been reworked (XVth Southeastern Conf. on Comb., Graph Theory, and Comp.) in terms of \(b_ 0\), \(b_ 1\), \(b_ 2\), \(c_ 2\), and \(\theta_ 1\), where \(\theta_ 1\) was shown to be a common root of many fourth degree polynomials in the integer parameters. Much of this material and the surrounding theory is now in book form: \textit{E. Bannai} and \textit{T. Ito,} Algebraic Combinatorics I, Association Schemes (1984).
    0 references
    association scheme
    0 references
    distance regular graph
    0 references
    orthogonal polynomials
    0 references

    Identifiers