English

Taut distance-regular graphs and the subconstituent algebra

Combinatorics 2007-05-23 v1 Representation Theory

Abstract

We consider a bipartite distance-regular graph GG with diameter DD at least 4 and valency kk at least 3. We obtain upper and lower bounds for the local eigenvalues of GG in terms of the intersection numbers of GG and the eigenvalues of GG. Fix a vertex of GG and let TT denote the corresponding subconstituent algebra. We give a detailed description of those thin irreducible TT-modules that have endpoint 2 and dimension D3D-3. In an earlier paper the first author defined what it means for GG to be taut. We obtain three characterizations of the taut condition, each of which involves the local eigenvalues or the thin irreducible TT-modules mentioned above.

Keywords

Cite

@article{arxiv.math/0508399,
  title  = {Taut distance-regular graphs and the subconstituent algebra},
  author = {Mark S. MacLean and Paul Terwilliger},
  journal= {arXiv preprint arXiv:math/0508399},
  year   = {2007}
}

Comments

29 pages