Abelian spiders and real cyclotomic integers

Abelian spiders and real cyclotomic integers
复制标题

阿贝尔蜘蛛网和实分圆整数

DOI:
10.1090/tran/7237
复制
发表时间:
2018
影响因子:
1.3
通讯作者:
Guo, Zoey
Guo, Zoey
中科院分区:
数学1区
文献类型:
--
作者:
Calegari, Frank;Guo, Zoey

文献摘要

参考文献

被引文献

相似文献

如果是有限图,则的邻接矩阵的最大特征值是一个全实代数整数(是的Perron-Frobenius特征值)。如果由产生的场是阿贝尔的,我们就说它是阿贝尔的。给定一个固定的图和的一个固定的顶点集,我们定义蜘蛛图是通过附加到某些有限长的叶树的每个选定的顶点而得到的图。主要结果是,相应的蜘蛛图中只有有限多个既是阿贝尔图又不是动态图,并且所有这样的蜘蛛都可以有效地列举出来;这推广了Calegari、Morrison和Snyder以前的一个结果。主要定理对有限指标子因子的分类有一定的应用。我们还证明了“阿贝尔型”的Salem数集是离散的。参考文献
Ifis a finite graph, then the largest eigenvalueof the adjacency matrix ofis a totally real algebraic integer (is the Perron-Frobenius eigenvalue of). We say thatis abelian if the field generated byis abelian. Given a fixed graphand a fixed set of vertices of, we define a spider graph to be a graph obtained by attaching to each of the chosen vertices ofsome-valent trees of finite length. The main result is that only finitely many of the corresponding spider graphs are both abelian and not Dynkin diagrams, and that all such spiders can be effectively enumerated; this generalizes a previous result of Calegari, Morrison, and Snyder. The main theorem has applications to the classification of finite index subfactors. We also prove that the set of Salem numbers of “abelian type” is discrete. References
分圆整数、融合范畴和子因子
DOI: 10.1007/s00220-010-1136-2
发表时间: 2010
影响因子: 2.4
作者:
Frank Calegari;S. Morrison;Noah Snyder
通讯作者: Noah Snyder
DOI: 10.1017/s1446788700016426
发表时间: 1980
期刊: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
影响因子: --
作者:
By C. P. Smyth
通讯作者: By C. P. Smyth