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

From MaRDI portal
Publication:501689

DOI10.1016/J.JCTA.2016.11.006zbMATH Open1352.05094arXiv1509.04433OpenAlexW2176359509MaRDI QIDQ501689FDOQ501689


Authors: Jae-Ho Lee Edit this on Wikidata


Publication date: 9 January 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: In his famous theorem (1982), Douglas Leonard characterized the q-Racah polynomials and their relatives in the Askey scheme from the duality property of Q-polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or Laurent) version of the q-Racah polynomials in the above situation. Let Gamma denote a Q-polynomial distance-regular graph that contains a Delsarte clique C. Assume that Gamma has q-Racah type. Fix a vertex xinC. We partition the vertex set of Gamma according to the path-length distance to both x and C. 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 hatHq of type (C1vee,C1). From this module, we naturally obtain a finite sequence of orthogonal Laurent polynomials. We prove the orthogonality relations for these polynomials, using the hatHq-module and the theory of Leonard systems. Changing hatHq by hatHq1 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 q-Racah polynomials.


Full work available at URL: https://arxiv.org/abs/1509.04433




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501689)