English

The Terwilliger Algebra of a Distance-Regular Graph of Negative Type

Combinatorics 2008-04-11 v1

Abstract

Let Γ\Gamma denote a distance-regular graph with diameter D3D \ge 3. Assume Γ\Gamma has classical parameters (D,b,α,β)(D,b,\alpha,\beta) with b<1b < -1. Let XX denote the vertex set of Γ\Gamma and let AMXA \in MX denote the adjacency matrix of Γ\Gamma. Fix xXx \in X and let AMXA^* \in MX denote the corresponding dual adjacency matrix. Let TT denote the subalgebra of MXMX generated by A,AA, A^*. We call TT the {\em Terwilliger algebra} of Γ\Gamma with respect to xx. We show that up to isomorphism there exist exactly two irreducible TT-modules with endpoint 1; their dimensions are DD and 2D22D-2. For these TT-modules we display a basis consisting of eigenvectors for AA^*, and for each basis we give the action of AA

Keywords

Cite

@article{arxiv.0804.1650,
  title  = {The Terwilliger Algebra of a Distance-Regular Graph of Negative Type},
  author = {Stefko Miklavic},
  journal= {arXiv preprint arXiv:0804.1650},
  year   = {2008}
}