Distance-regular graphs of q-Racah type and the q-tetrahedron algebra
نویسندگان
چکیده
In this paper we discuss a relationship between the following two algebras: (i) the subconstituent algebra T of a distance-regular graph that has q-Racah type; (ii) the q-tetrahedron algebra ⊠q which is a q-deformation of the three-point sl2 loop algebra. Assuming that every irreducible T -module is thin, we display an algebra homomorphism from ⊠q into T and show that T is generated by the image together with the center Z(T ).
منابع مشابه
Nonsymmetric Askey-Wilson polynomials and Q-polynomial distance-regular graphs
In his famous theorem (1982), Douglas Leonard characterized the q-Racah polynomials and their relatives in the Askey scheme from the duality property of Q-polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or Laurent) version of the q-Racah polynomials in the above situation. Let Γ denote a Q-polynomial distance-regular graph that contains a Delsarte clique C. Assume ...
متن کاملDistance-regular graphs and the q-tetrahedron algebra
Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and b 6= 1, α = b − 1. The condition on α implies that Γ is formally self-dual. For b = q we use the adjacency matrix and dual adjacency matrix to obtain an action of the q-tetrahedron algebra ⊠q on the standard module of Γ. We describe four algebra homomorphisms into ⊠q from the quantum affine algebra Uq(ŝl2); using t...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملq-Inverting pairs of linear transformations and the q-tetrahedron algebra
As part of our study of the q-tetrahedron algebra ⊠q we introduce the notion of a q-inverting pair. Roughly speaking, this is a pair of invertible semisimple linear transformations on a finite-dimensional vector space, each of which acts on the eigenspaces of the other according to a certain rule. Our main result is a bijection between the following two sets: (i) the isomorphism classes of fini...
متن کاملSome matrices associated with the split decomposition for a Q-polynomial distance-regular graph
We consider a Q-polynomial distance-regular graph Γ with vertex set X and diameter D ≥ 3. For μ, ν ∈ {↓, ↑} we define a direct sum decomposition of the standard module V = CX, called the (μ, ν)–split decomposition. For this decomposition we compute the complex conjugate and transpose of the associated primitive idempotents. Now fix b, β ∈ C such that b 6= 1 and assume Γ has classical parameters...
متن کامل