Nonsymmetric Askey-Wilson polynomials and -polynomial distance-regular graphs
arXiv:1509.04433 · doi:10.1016/j.jcta.2016.11.006
Abstract
In his famous theorem (1982), Douglas Leonard characterized the -Racah polynomials and their relatives in the Askey scheme from the duality property of -polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or Laurent) version of the -Racah polynomials in the above situation. Let denote a -polynomial distance-regular graph that contains a Delsarte clique . Assume that has -Racah type. Fix a vertex . We partition the vertex set of according to the path-length distance to both and . The linear span of the characteristic vectors corresponding to the cells in this partition has an irreducible module structure for the universal double affine Hecke algebra of type . From this module, we naturally obtain a finite sequence of orthogonal Laurent polynomials. We prove the orthogonality relations for these polynomials, using the -module and the theory of Leonard systems. Changing by we show how our Laurent polynomials are related to the nonsymmetric Askey-Wilson polynomials, and therefore how our Laurent polynomials can be viewed as nonsymmetric -Racah polynomials.
38 pages, 3 figures