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

Abstract

We study a relationship between Q-polynomial distance-regular graphs and the double affine Hecke algebra of type (C1,C1). Let denote a Q-polynomial distance-regular graph with vertex set X. We assume that has q-Racah type and contains a Delsarte clique C. Fix a vertex x ∈ C. We partition X according to the path-length distance to both x and C. 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-vector space W. The universal double affine Hecke algebra of type (C1,C1) is the C-algebra Hq defined by generators \t1n\3n=0 and relations (i) tntn-1=tn-1tn=1; (ii) tn+tn-1 is central; (iii) t0t1t2t3 = q-1/2. In this paper, we display an Hq-module structure for W. For this module and up to affine transformation, (i) t0t1+(t0t1)-1 acts as the adjacency matrix of ; (ii) t3t0+(t3t0)-1 acts as the dual adjacency matrix of with respect to C; (iii) t1t2+(t1t2)-1 acts as the dual adjacency matrix of with respect to x. To obtain our results we use the theory of Leonard systems.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…