Every $Q$-polynomial distance-regular graph is sharp over $\mathbb{R}$
Blas Fern\'andez, Jae-Ho Lee, Jongyook Park

TL;DR
This paper proves that all irreducible modules of the Terwilliger algebra of a $Q$-polynomial distance-regular graph over the reals are sharp, extending known results from complex to real fields, and explores their algebraic implications.
Contribution
It establishes that every irreducible $T^ extbf{R}$-module is sharp, generalizing prior complex field results, and derives structural properties of the Terwilliger algebra over $ extbf{R}$.
Findings
All irreducible $T^ extbf{R}$-modules are sharp.
Complexification preserves irreducibility and isomorphism classes.
The Wedderburn decomposition over $ extbf{R}$ mirrors that over $ extbf{C}$.
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…
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.
Taxonomy
TopicsFinite Group Theory Research · Rings, Modules, and Algebras · Algebraic structures and combinatorial models
