Spectra of semi-regular polytopes

From MaRDI portal



Abstract: We compute the spectra of the adjacency matrices of the semi-regular polytopes. A few different techniques are employed: the most sophisticated, which relates the 1-skeleton of the polytope to a Cayley graph, is based on methods akin to those of Lov'asz and Babai ([L], [B]). It turns out that the algebraic degree of the eigenvalues is at most 5, achieved at two 3-dimensional solids.


Symmetries of a graph \(G\) are helpful in computing its spectrum (i.e., the set of eigenvalues of the adjacency matrix of \(G)\). Due to Lovász and Babai, one can use techniques from representation theory of groups to reduce significantly the algebraic degree of the problem if the symmetry group acts transitively on the vertices. Continuing their investigations related to the spectra of the graphs of regular polytopes, the authors compute the spectra of all semi-regular polytopes (having regular faces and a symmetry group that acts transitively on their vertices). The characteristic polynomials of the adjacency matrices are completely factored in \(\mathbb{Z}[\tau]\), \(\tau=(1+\sqrt 5)/2\), and it turns out that the algebraic degree of the eigenvalues is at most 5, achieved at two 3-dimensional polyhedra. The article is divided into several sections, depending on the type of methods that are necessary for investigating different types of semi-regular polytopes. E.g., the two Archimedean solids mentioned above are studied with the help of three discrete subgroups of the unit sphere of the quaternion sphere, and for the known Gosset polytopes techniques from the study of regular polytopes are repeatedly applied.











This page was built for publication: Spectra of semi-regular polytopes

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