Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra
Paul Terwilliger, Chih-wen Weng
Abstract
Let Γ denote a distance-regular graph with diameter D≥ 3 and Bose-Mesner algebra M. For θ∈ C ∞ we define a 1 dimensional subspace of M which we call M(θ). If θ∈ C then M(θ) consists of those Y in M such that (A-θI)Y∈ C AD, where A (resp. AD) is the adjacency matrix (resp. Dth distance matrix) of Γ. If θ= ∞ then M(θ)= C AD. By a pseudo primitive idempotent for θ we mean a nonzero element of M(θ). We use pseudo primitive idempotents to describe the irreducible modules for the Terwilliger algebra, that are thin with endpoint one.
Create a lesson
Related papers
2-large sets are sets of nil-Bohr recurrence
Ryan Alweiss, Sohail Farhangi
New tools for sparse graph embeddings: Hybrid expanders and application to nested cycles
Nemanja Draganić
Edge and spectral conditions for rainbow bipancyclicity in bipartite graph collections
Lihua You, Xiaoxue Zhang, Xinghui Zhao
The rich-neighbor chromatic index is linear in the maximum degree
Masaki Kashima, Mirko Petruševski, Jelena Sedlar et al.
The (km,kn)-square paths theorem
Dun Qiu, Minhao Zhang
Towards a Sum-of-Squares Proof for the Nonexistence of Conway's 99-graph
Joseph Natal, Oleksiy Al-saadi