The quantum adjacency algebra and subconstituent algebra of a graph

From MaRDI portal
Publication:2000651

DOI10.1016/J.JCTA.2019.02.022zbMATH Open1416.05142arXiv1710.06011OpenAlexW2963043209MaRDI QIDQ2000651FDOQ2000651

Arjana Žitnik, Paul Terwilliger

Publication date: 28 June 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: Let Gamma denote a finite, undirected, connected graph, with vertex set X. Fix a vertex xinX. Associated with x is a certain subalgebra T=T(x) of mMatX(mathbbC), called the subconstituent algebra. The algebra T is semisimple. Hora and Obata introduced a certain subalgebra QsubseteqT, called the quantum adjacency algebra. The algebra Q is semisimple. In this paper we investigate how Q and T are related. In many cases Q=T, but this is not true in general. To clarify this issue, we introduce the notion of quasi-isomorphic irreducible T-modules. We show that the following are equivalent: (i) QeqT; (ii) there exists a pair of quasi-isomorphic irreducible T-modules that have different endpoints. To illustrate this result we consider two examples. The first example concerns the Hamming graphs. The second example concerns the bipartite dual polar graphs. We show that for the first example Q=T, and for the second example QeqT.


Full work available at URL: https://arxiv.org/abs/1710.06011





Cites Work


Cited In (13)






This page was built for publication: The quantum adjacency algebra and subconstituent algebra of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000651)