QQ-polynomial distance-regular graphs and a double affine Hecke algebra of rank one

preprint2016arXivOpen access

Abstract

We study a relationship between QQ-polynomial distance-regular graphs and the double affine Hecke algebra of type (C1∨,C1)(C^{\vee}_1,C_1). Let ΓΓ denote a QQ-polynomial distance-regular graph with vertex set XX. We assume that ΓΓ has qq-Racah type and contains a Delsarte clique CC. Fix a vertex x∈Cx \in C. We partition XX according to the path-length distance to both xx and CC. This is an equitable partition. For each cell in this partition, consider the corresponding characteristic vector. These characteristic vectors form a basis for a C\mathbb{C}-vector space W{\bf W}. The universal double affine Hecke algebra of type (C1∨,C1)(C^{\vee}_1,C_1) is the C\mathbb{C}-algebra H^q\hat{H}_q defined by generators {tn±1}n=03\{t^{\pm1}_n\}^3_{n=0} and relations (i) tntn−1=tn−1tn=1t_nt_n^{-1}=t_n^{-1}t_n=1; (ii) tn+tn−1t_n+t_n^{-1} is central; (iii) t0t1t2t3=q−1/2t_0t_1t_2t_3 = q^{-1/2}. In this paper, we display an H^q\hat{H}_q-module structure for W{\bf W}. For this module and up to affine transformation, (i) t0t1+(t0t1)−1t_0t_1+(t_0t_1)^{-1} acts as the adjacency matrix of ΓΓ; (ii) t3t0+(t3t0)−1t_3t_0+(t_3t_0)^{-1} acts as the dual adjacency matrix of ΓΓ with respect to CC; (iii) t1t2+(t1t2)−1t_1t_2+(t_1t_2)^{-1} acts as the dual adjacency matrix of ΓΓ with respect to xx. To obtain our results we use the theory of Leonard systems.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.