Abelian Spiders

arXiv1502.00035MaRDI QIDQ6258657FDOQ6258657

Authors: Frank Calegari, Zoey Guo 

Publication date: 30 January 2015

Abstract: If G is a finite graph, then the largest eigenvalue L of the adjacency matrix of G is a totally real algebraic integer (L is the Perron-Frobenius eigenvalue of G). We say that G is abelian if the field generated by L^2 is abelian. Given a fixed graph G and a fixed set of vertices of G, we define a spider graph to be a graph obtained by attaching to each of the chosen vertices of G some 2-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.

This page was built for publication: Abelian Spiders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6258657)