English

Every $Q$-polynomial distance-regular graph is sharp over $\mathbb{R}$

Combinatorics 2025-11-25 v1 Representation Theory

Abstract

Let Γ\Gamma denote a distance-regular graph with vertex set XX and diameter D3D \geq 3. Fix a vertex xXx \in X. Let the field F\mathbb{F} be either R\mathbb{R} or C\mathbb{C}. Let MatX(F)\operatorname{Mat}_X(\mathbb{F}) denote the F\mathbb{F}-algebra of matrices whose rows and columns are indexed by XX and all entries in F\mathbb{F}. The Terwilliger algebra TF=TF(x)T^\mathbb{F} = T^\mathbb{F}(x) is the subalgebra of MatX(F)\operatorname{Mat}_X(\mathbb{F}) generated by the adjacency matrix AA of Γ\Gamma and the dual primitive idempotents {Ei}i=0D\{E_i^*\}_{i=0}^D of Γ\Gamma with respect to xx. Let {Ei}i=0D\{E_i\}_{i=0}^D denote the primitive idempotents of AA. Assume that the ordering {Ei}i=0D\{E_i\}_{i=0}^D is QQ-polynomial. Let WW denote an irreducible TFT^\mathbb{F}-module. We say that WW is sharp over F\mathbb{F} whenever dim(ErW)=1\dim (E_r^* W) = 1, where rr is the endpoint of WW. It is known, by Nomura and Terwilliger (2008), that every irreducible TCT^\mathbb{C}-module is sharp. In this paper, we prove that every irreducible TRT^\mathbb{R}-module is sharp. Once this is established, we obtain four additional results: (i) if WW is an irreducible TRT^\mathbb{R}-module, then its complexification WC=WRCW^\mathbb{C}= W \otimes_{\mathbb{R}} \mathbb{C} is an irreducible TCT^\mathbb{C}-module; (ii) two irreducible TRT^\mathbb{R}-modules W1W_1 and W2W_2 are isomorphic if and only if their complexifications W1CW_1^\mathbb{C} and W2CW_2^\mathbb{C} are isomorphic as TCT^\mathbb{C}-modules; (iii) if i=1hMatni(C)\bigoplus_{i=1}^h \operatorname{Mat}_{n_i}(\mathbb{C}) is the Wedderburn decomposition of TCT^\mathbb{C}, then i=1hMatni(R)\bigoplus_{i=1}^h \operatorname{Mat}_{n_i}(\mathbb{R}) is the Wedderburn decomposition of TRT^\mathbb{R}; (iv) each of the subalgebras E1TE1E_1^* T E_1^*, E1TE1E_1 T E_1, EDTEDE_D^* T E_D^*, and EDTEDE_D T E_D is commutative and every element of these algebras is a symmetric matrix.

Keywords

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

R2 v1 2026-07-01T07:52:14.280Z