The Norton-Balanced Condition for -Polynomial Distance-Regular Graphs
Kazumasa Nomura, Paul Terwilliger
Source abstract
Let denote a -polynomial distance-regular graph, with vertex set and diameter . The standard module has a basis , where denotes column of the identity matrix . Let denote a -polynomial primitive idempotent of . The eigenspace is spanned by the vectors . It was previously known that these vectors satisfy a condition called the balanced set condition. In this paper, we introduce a variation on the balanced set condition called the Norton-balanced condition. The Norton-balanced condition involves the Norton algebra product on . We define to be Norton-balanced whenever has a -polynomial primitive idempotent such that the set is Norton-balanced. We show that is Norton-balanced in the following cases: (i) is bipartite; (ii) is almost bipartite; (iii) is dual-bipartite; (iv) is almost dual-bipartite; (v) is tight; (vi) is a Hamming graph; (vii) is a Johnson graph; (viii) is the Grassmann graph ; (ix) is a halved bipartite dual-polar graph; (x) is a halved Hemmeter graph; (xi) is a halved hypercube; (xii) is a folded-half hypercube; (xiii) has -Racah type and affords a spin model. Some theoretical results about the Norton-balanced condition are obtained, and some open problems are given.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.