On the multiplicities of the primitive idempotents of a Q-polynomial distance-regular graph
Ito, Tanabe and Terwilliger recently introduced the notion of a tridiagonal pair. We apply their results to distance-regular graphs and obtain the following theorem. THEOREM. Let Γ denote a distance-regular graph with diameter D ≥ 3. Suppose Γ is Q-polynomial with respect to the ordering E0, E1,...,...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2002
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/3606 https://animorepository.dlsu.edu.ph/context/faculty_research/article/4608/type/native/viewcontent/eujc.2002.0607 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | Ito, Tanabe and Terwilliger recently introduced the notion of a tridiagonal pair. We apply their results to distance-regular graphs and obtain the following theorem. THEOREM. Let Γ denote a distance-regular graph with diameter D ≥ 3. Suppose Γ is Q-polynomial with respect to the ordering E0, E1,..., ED of the primitive idempotents. For 0 ≤ i ≤ D, let mi, denote the multiplicity of E i. Then (i) mi-1 ≤ mi (1 ≤ i ≤ D/2), (ii) mi ≤ mD-i (0 ≤ i ≤ D/2). By proving the above theorem we resolve a conjecture of Dennis Stanton. © 2002 Elsevier Science Ltd. All rights reserved. |
|---|