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

数字博弈与Dynkin图分类结果

The numbers game and Dynkin diagram classification results

Robert G. Donnelly, Kimmo Eriksson

摘要:

数字博弈是在有限的单图上进行的单人博弈,图的边被赋予一定的“振幅”,图的节点被初始分配实数。游戏的移动以一定的方式使用幅度连续地变换节点处的数字。利用组合推理证明了那些具有负整数振幅且数字博弈满足一定有限性要求的连通图正是有限维复单李代数的Dynkin图.这加强了最初由于第二作者的结果。当允许某些实数振幅时,得到了更一般的结果。由此产生的图是在家庭,每个家庭对应于一个有限的不可约考克斯特群。利用这些结果证明了,只有有限维复半单李代数上的广义Cartan矩阵存在具有某种结构性质的有限边色秩偏序集.在这种情况下,分类的有限维Kac-穆迪代数和有限Coxeter和外尔群重新推导。

英文摘要:

The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at the nodes using the amplitudes in a certain way. Combinatorial reasoning is used to show that those connected graphs with negative integer amplitudes for which the numbers game meets a certain finiteness requirement are precisely the Dynkin diagrams associated with the finite-dimensional complex simple Lie algebras. This strengthens a result originally due to the second author. A more general result is obtained when certain real number amplitudes are allowed. The resulting graphs are in families, each family corresponding to a finite irreducible Coxeter group. These results are used to demonstrate that the only generalized Cartan matrices for which there exist finite edge-colored ranked posets enjoying a certain structure property are the Cartan matrices for the finite-dimensional complex semisimple Lie algebras. In this setting, classifications of the finite-dimensional Kac--Moody algebras and of the finite Coxeter and Weyl groups are re-derived.

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

↑