Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra
Combinatorics
2007-05-23 v1 Representation Theory
Abstract
Let denote a distance-regular graph with diameter and Bose-Mesner algebra . For we define a 1 dimensional subspace of which we call . If then consists of those in such that , where (resp. ) is the adjacency matrix (resp. th distance matrix) of If then . By a {\it pseudo primitive idempotent} for we mean a nonzero element of . We use pseudo primitive idempotents to describe the irreducible modules for the Terwilliger algebra, that are thin with endpoint one.
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