Spin models and distance-regular graphs of q-Racah type
Abstract
Let denote a distance-regular graph, with vertex set X and diameter D≥ 3. We assume that is formally self-dual and q-Racah type. We also assume that for each x ∈ X the subconstituent algebra T=T(x) contains a certain central element Z=Z(x). We use Z to construct a spin model W afforded by . We investigate the combinatorial implications of Z. We reverse the logical direction and recover Z from W. We finish with some open problems.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.