...
首页> 外文期刊>Journal of algebraic combinatorics >The Terwilliger algebra of the incidence graph of the Hamming graph
【24h】

The Terwilliger algebra of the incidence graph of the Hamming graph

机译:汉明图的爆发图的Terwilliger代数

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Let be a distance-semiregular graph on Y, and let be the diameter of on Y. Let be the halved graph of on Y. Fix . Let T and be the Terwilliger algebras of and with respect to x, respectively. Assume, for an integer i with and for with , the numbers and depend only on i and do not depend on the choice of y, z. The first goal in this paper is to show the relations between T-modules of and -modules of . Assume is the incidence graph of the Hamming graph H(D, n) on the vertex set Y and the set of all maximal cliques. Then, satisfies above assumption and is isomorphic to H(D, n). The second goal is to determine the irreducible T-modules of . For each irreducible T-module W, we give a basis for W the action of the adjacency matrix on this basis and we calculate the multiplicity of W.
机译:设为Y上的距离半正则图,设为Y上的直径,设为Y上的对半图。设T和分别是关于x的和的Terwilliger代数。假设对于带和带的整数i,数字和仅依赖于i,而不依赖于y,z的选择。本文的第一个目标是展示和的T模之间的关系。假设是Hamming图H(D,n)在顶点集Y和所有极大团集上的关联图。然后,满足上述假设,与H(D,n)同构。第二个目标是确定系统的不可约T模。对于每个不可约T模,我们给出了W的一个基——邻接矩阵在此基上的作用,并计算了W的重数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号