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

From MaRDI portal
Publication:2435529



Abstract: We study a relationship between Q-polynomial distance-regular graphs and the double affine Hecke algebra of type (C1vee,C1). Let Gamma denote a Q-polynomial distance-regular graph with vertex set X. We assume that Gamma has q-Racah type and contains a Delsarte clique C. Fix a vertex xinC. 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 mathbbC-vector space . The universal double affine Hecke algebra of type (C1vee,C1) is the mathbbC-algebra hatHq defined by generators tnpm1n=03 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 hatHq-module structure for . For this module and up to affine transformation, (i) t0t1+(t0t1)−1 acts as the adjacency matrix of Gamma; (ii) t3t0+(t3t0)−1 acts as the dual adjacency matrix of Gamma with respect to C; (iii) t1t2+(t1t2)−1 acts as the dual adjacency matrix of Gamma with respect to x. To obtain our results we use the theory of Leonard systems.




Cites work









This page was built for publication: \(Q\)-polynomial distance-regular graphs and a double affine Hecke algebra of rank one

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