$Q$-polynomial distance-regular graphs and a double affine Hecke algebra of rank one
Jae-Ho Lee

TL;DR
This paper explores the connection between $Q$-polynomial distance-regular graphs of $q$-Racah type and the double affine Hecke algebra of rank one, establishing a module structure that links algebraic and combinatorial properties.
Contribution
It constructs an $ ilde{H}_q$-module structure on a vector space derived from a $Q$-polynomial distance-regular graph, connecting graph adjacency matrices with Hecke algebra elements.
Findings
The module structure relates adjacency matrices to Hecke algebra generators.
It characterizes dual adjacency matrices via algebraic actions.
Uses Leonard systems to establish the algebraic-combinatorial link.
Abstract
We study a relationship between -polynomial distance-regular graphs and the double affine Hecke algebra of type . Let denote a -polynomial distance-regular graph with vertex set . We assume that has -Racah type and contains a Delsarte clique . Fix a vertex . We partition according to the path-length distance to both and . This is an equitable partition. For each cell in this partition, consider the corresponding characteristic vector. These characteristic vectors form a basis for a -vector space . The universal double affine Hecke algebra of type is the -algebra defined by generators and relations (i) ; (ii) is central; (iii) . In this paper, we display an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
