Leonard pairs, spin models, and distance-regular graphs
Kazumasa Nomura, Paul Terwilliger

TL;DR
This paper explores the relationship between spin models, Leonard pairs, and distance-regular graphs, establishing conditions under which a graph admits a spin model and constructing such models explicitly for q-Racah type graphs.
Contribution
It proves that certain module conditions imply a distance-regular graph admits a spin model and explicitly constructs these models for q-Racah type graphs.
Findings
A characterization of when a distance-regular graph admits a spin model.
Explicit construction of spin models for q-Racah type graphs.
Connection between Terwilliger algebra modules and spin models.
Abstract
A Leonard pair is an ordered pair of diagonalizable linear maps on a finite-dimensional vector space, that each act on an eigenbasis for the other one in an irreducible tridiagonal fashion. In the present paper we consider a type of Leonard pair, said to have spin. The notion of a spin model was introduced by V.F.R. Jones to construct link invariants. A spin model is a symmetric matrix over that satisfies two conditions, called the type II and type III conditions. It is known that a spin model is contained in a certain finite-dimensional algebra , called the Nomura algebra. It often happens that a spin model satisfies , where is the Bose-Mesner algebra of a distance-regular graph ; in this case we say that affords . If affords a spin model, then each irreducible…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Algebraic structures and combinatorial models · Advanced Topics in Algebra
