Every $Q$-polynomial distance-regular graph is sharp over $\mathbb{R}$
Abstract
Let denote a distance-regular graph with vertex set and diameter . Fix a vertex . Let the field be either or . Let denote the -algebra of matrices whose rows and columns are indexed by and all entries in . The Terwilliger algebra is the subalgebra of generated by the adjacency matrix of and the dual primitive idempotents of with respect to . Let denote the primitive idempotents of . Assume that the ordering is -polynomial. Let denote an irreducible -module. We say that is sharp over whenever , where is the endpoint of . It is known, by Nomura and Terwilliger (2008), that every irreducible -module is sharp. In this paper, we prove that every irreducible -module is sharp. Once this is established, we obtain four additional results: (i) if is an irreducible -module, then its complexification is an irreducible -module; (ii) two irreducible -modules and are isomorphic if and only if their complexifications and are isomorphic as -modules; (iii) if is the Wedderburn decomposition of , then is the Wedderburn decomposition of ; (iv) each of the subalgebras , , , and is commutative and every element of these algebras is a symmetric matrix.
Cite
@article{arxiv.2511.19164,
title = {Every $Q$-polynomial distance-regular graph is sharp over $\mathbb{R}$},
author = {Blas Fernández and Jae-Ho Lee and Jongyook Park},
journal= {arXiv preprint arXiv:2511.19164},
year = {2025}
}
Comments
32pages