arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.4549math.CO
收藏

关于A、B、C型晶体的组合结构

On the combinatorial structure of crystals of types A,B,C

Vladimir Danilov, Alexander Karzanov, Gleb Koshevoy

摘要:

规则$A_n$ -、$B_n$ -和$C_n$ -晶体是边着色有向图,具有有序颜色$1,2,...,n$,它们分别与量子化代数$U_q(\mathfrak{sl}_{n+1})$、$U_q(\mathfrak{sp}_{2n})$和$U_q(\mathfrak{so}_{2n+1})$的表示有关。我们开发组合方法来揭示这些对象的精细结构特性。首先,我们研究了规则的$A_n$ -晶体$K$的亚晶体,并刻画了最大亚晶体与颜色$1,...,n-1$和颜色$2,...,n$的两两相交.这导致了$K$结构的递归描述,并提供了一个有效的程序组装$K$。其次,仅使用组合手段,我们证明了规则的$B_n$ -晶体(分别为)之间的关系。$C_n$ -晶体)和规则对称$A_{2n-1}$ -晶体(分别为$A_{2n}$ -晶体)。

英文摘要:

Regular $A_n$-, $B_n$- and $C_n$-crystals are edge-colored directed graphs, with ordered colors $1,2,...,n$, which are related to representations of quantized algebras $U_q(\mathfrak{sl}_{n+1})$, $U_q(\mathfrak{sp}_{2n})$ and $U_q(\mathfrak{so}_{2n+1})$, respectively. We develop combinatorial methods to reveal refined structural properties of such objects. Firstly, we study subcrystals of a regular $A_n$-crystal $K$ and characterize pairwise intersections of maximal subcrystals with colors $1,...,n-1$ and colors $2,...,n$. This leads to a recursive description of the structure of $K$ and provides an efficient procedure of assembling $K$. Secondly, using merely combinatorial means, we demonstrate a relationship between regular $B_n$-crystals (resp. $C_n$-crystals) and regular symmetric $A_{2n-1}$-crystals (resp. $A_{2n}$-crystals).

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

↑