On bipartite distance-regular graphs with exactly two irreducible T-modules with endpoint 2
Mark S. MacLean (Mathematics Department, Seattle University), Stefko, Miklavic (University of Primorska)

TL;DR
This paper characterizes bipartite distance-regular graphs with exactly two thin irreducible Terwilliger modules of endpoint 2, using a parameter elta_2 and intersection number conditions.
Contribution
It establishes an equivalence between a parameter elta_2>0 with certain intersection properties and the existence of exactly two thin irreducible Terwilliger modules with endpoint 2.
Findings
elta_2>0 and intersection conditions hold
Exactly two thin irreducible Terwilliger modules with endpoint 2 exist
Characterization of graph structure via algebraic and combinatorial properties
Abstract
Let denote a bipartite distance-regular graph with diameter and valency . Let denote the vertex set of , and let denote the adjacency matrix of . For let denote the subalgebra of Mat generated by , where for , represents the projection onto the th subconstituent of with respect to . We refer to as the {\em Terwilliger algebra} of with respect to . An irreducible -module is said to be {\em thin} whenever dim for . By the {\em endpoint} of we mean min. For , let denote the set of vertices in that are distance from vertex . Define a parameter in terms of the intersection numbers by $\Delta_2 =…
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 · graph theory and CDMA systems · Algebraic structures and combinatorial models
