English

Nonsymmetric Askey-Wilson polynomials and $Q$-polynomial distance-regular graphs

Combinatorics 2018-09-25 v2

Abstract

In his famous theorem (1982), Douglas Leonard characterized the qq-Racah polynomials and their relatives in the Askey scheme from the duality property of QQ-polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or Laurent) version of the qq-Racah polynomials in the above situation. Let Γ\Gamma denote a QQ-polynomial distance-regular graph that contains a Delsarte clique CC. Assume that Γ\Gamma has qq-Racah type. Fix a vertex xCx \in C. We partition the vertex set of Γ\Gamma according to the path-length distance to both xx and CC. 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 H^q\hat{H}_q of type (C1,C1)(C^{\vee}_1, C_1). From this module, we naturally obtain a finite sequence of orthogonal Laurent polynomials. We prove the orthogonality relations for these polynomials, using the H^q\hat{H}_q-module and the theory of Leonard systems. Changing H^q\hat{H}_q by H^q1\hat{H}_{q^{-1}} 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 qq-Racah polynomials.

Keywords

Cite

@article{arxiv.1509.04433,
  title  = {Nonsymmetric Askey-Wilson polynomials and $Q$-polynomial distance-regular graphs},
  author = {Jae-Ho Lee},
  journal= {arXiv preprint arXiv:1509.04433},
  year   = {2018}
}

Comments

38 pages, 3 figures

R2 v1 2026-06-22T10:56:54.956Z