Pseudo Primitive Idempotents and Bipartite Q-Polynomial Distance-Regular Graphs
Presented by Michael LANG
Type: Oral presentation
Track: Representations of Graphs
Terwilliger and Weng defined pseudo primitive idempotents. MacLean and Terwilliger drew attention to the entrywise product of those pseudo idempotents associated with modules of the Terwilliger algebra of a distance-regular graph. We will discuss these issues, particularly in the bipartite Q-polynomial context.