On bipartite distance-regular graphs with exactly two irreducible T-modules with endpoint 2
Abstract
Let denote a bipartite distance-regular graph with diameter D 4 and valency k 3. Let X denote the vertex set of , and let A denote the adjacency matrix of . For x ∈ X let T=T(x) denote the subalgebra of MatX(C generated by A, E*0, E*s1, …, E*D, where for 0 i D, E*i represents the projection onto the ith subconstituent of with respect to x. We refer to T as the Terwilliger algebra of with respect to x. An irreducible T-module W is said to be thin whenever dim E*i W 1 for 0 i D. By the endpoint of W we mean min\i | E*iW 0\. For 0 i D, let i(z) denote the set of vertices in X that are distance i from vertex z. Define a parameter 2 in terms of the intersection numbers by 2 = (k-2)(c3-1)-(c2-1)p222. In this paper we prove the following are equivalent: (i) 2>0 and for 2 i D - 2 there exist complex scalars αi, βi with the following property: for all x, y, z ∈ X such that ∂(x, y) = 2, \: ∂(x, z) = i, \: ∂(y, z) = i we have αi + βi |1(x) 1(y) i-1(z)| = |i-1(x) i-1(y) 1(z)|; (ii) For all x ∈ X there exist up to isomorphism exactly two irreducible modules for the Terwilliger algebra T(x) with endpoint two, and these modules are thin.
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.