现实决定子图与强实模
Reality determining subgraphs and strongly real modules
AI总结：
本文推广了A型代数中树关联模为实模的结果，引入强实模与模树概念，证明包含蛇形树的广义树类产生强实模。
摘要：
伪q因子分解图的概念最近由最后两位作者引入，作为一种组合语言，适用于捕捉Drinfeld多项式的某些性质。利用关于Kirillov Reshetikhin模的张量积和q字符的某些已知表示论事实，结合底层q因子分解图的特殊拓扑/组合性质，最后两位作者证明了，对于A型代数，与全序图相关联的模是素模，而与树相关联的模是实模。在本文中，我们推广了后一个结果。我们引入了强实模的概念以及满足某些性质的模树的概念。特别地，我们可以考虑蛇形树，即由蛇形模形成的树。在其他结果中，我们证明了这类广义树中的某一类（其真包含蛇形树）产生强实模。
英文摘要：
The concept of pseudo q-factorization graphs was recently introduced by the last two authors as a combinatorial language which is suited for capturing certain properties of Drinfeld polynomials. Using certain known representation theoretic facts about tensor products of Kirillov Reshetikhin modules and qcharacters, combined with special topological/combinatorial properties of the underlying q-factorization graphs, the last two authors showed that, for algebras of type A, modules associated to totally ordered graphs are prime, while those associated to trees are real. In this paper, we extend the latter result. We introduce the notions of strongly real modules and that of trees of modules satisfying certain properties. In particular, we can consider snake trees, i.e., trees formed from snake modules. Among other results, we show that a certain class of such generalized trees, which properly contains the snake trees, give rise to strongly real modules.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
