arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1001.0280math.CO
收藏

对称链、Gelfand-Tsetlin链和二元Hamming概型的Terwilliger代数

Symmetric chains, Gelfand-Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme

Murali K. Srinivasan

摘要:

de Bruijn-Tengbergen-Kruyswijk(BTK)构造是一个简单的算法,它产生一个链的乘积的显式对称链分解。我们线性化的BTK算法,并表明,它产生一个显式的对称约旦基础(SJB)。在布尔代数的特殊情况下,所得的SJB关于标准内积正交,并且,此外,我们可以写出这些链中连续向量的长度之比的显式公式(即,奇异值)。这产生了一个新的,建设性的证明显式块对角化的Terwilliger代数的二进制汉明计划。我们还给出了一个表示理论的基础上,解释其正交性,即,它是规范定义的对称Gelfand-Tsetlin基础。

英文摘要:

The de Bruijn-Tengbergen-Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chain decomposition of a product of chains. We linearize the BTK algorithm and show that it produces an explicit symmetric Jordan basis (SJB). In the special case of a Boolean algebra the resulting SJB is orthogonal with respect to the standard inner product and, moreover, we can write down an explicit formula for the ratio of the lengths of the successive vectors in these chains (i.e., the singular values). This yields a new, constructive proof of the explicit block diagonalization of the Terwilliger algebra of the binary Hamming scheme. We also give a representation theoretic characterization of this basis that explains its orthogonality, namely, that it is the canonically defined (upto scalars) symmetric Gelfand-Tsetlin basis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑