English

Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra

Combinatorics 2007-05-23 v1 Representation Theory

Abstract

Let Γ\Gamma denote a distance-regular graph with diameter D3D\geq 3 and Bose-Mesner algebra MM. For θC\theta\in C\cup \infty we define a 1 dimensional subspace of MM which we call M(θ)M(\theta). If θC\theta\in C then M(θ)M(\theta) consists of those YY in MM such that (AθI)YCAD(A-\theta I)Y\in C A_D, where AA (resp. ADA_D) is the adjacency matrix (resp. DDth distance matrix) of Γ.\Gamma. If θ=\theta = \infty then M(θ)=CADM(\theta)= C A_D. By a {\it pseudo primitive idempotent} for θ\theta we mean a nonzero element of M(θ)M(\theta). We use pseudo primitive idempotents to describe the irreducible modules for the Terwilliger algebra, that are thin with endpoint one.

Keywords

Cite

@article{arxiv.math/0307269,
  title  = {Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra},
  author = {Paul Terwilliger and Chih-wen Weng},
  journal= {arXiv preprint arXiv:math/0307269},
  year   = {2007}
}

Comments

17 pages

R2 v1 2026-07-22T16:56:24.517Z