Abelian spiders and real cyclotomic integers
Abelian spiders and real cyclotomic integers
复制标题
阿贝尔蜘蛛网和实分圆整数
DOI:
10.1090/tran/7237
复制
发表时间:
2018
影响因子:
1.3
通讯作者:
Guo, Zoey
中科院分区:
文献类型:
--
作者:
Calegari, Frank;Guo, Zoey
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
影响因子:
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