Spectra of semi-regular polytopes
نویسندگان
چکیده
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ász and Babai ([L], [B]). It turns out that the algebraic degree of the eigenvalues is at most 5, achieved at two 3-dimensional solids.
منابع مشابه
On the Size of Equifacetted Semi-regular Polytopes
Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular abstract polytope can have an arbitrary large number of flag orbits or face orbits under its combinatorial automorphism group.
متن کاملSpectra of Regular Polytopes
Introduction As is well known, the combinatorial problem of counting paths of length n between two xed vertices in a graph reduces to raising the adjacency matrix A of the graph to the n-th power ((B], p. 11). For an undirected graph, A is symmetric and the problem above simpliies considerably if its spectrum (A) is known and contains few distinct elements. Spectra of graphs, meaning spectra of...
متن کاملOrientational Sampling Schemes Based on Four Dimensional Polytopes
The vertices of regular four-dimensional polytopes are used to generate sets of uniformly distributed three-dimensional rotations, which are provided as tables of Euler angles. The spherical moments of these orientational sampling schemes are treated using group theory. The orientational sampling sets may be used in the numerical computation of solid-state nuclear magnetic resonance spectra, an...
متن کاملTwisted Groups and Locally Toroidal Regular Polytopes
In recent years, much work has been done on the classification of abstract regular polytopes by their local and global topological type. Abstract regular polytopes are combinatorial structures which generalize the wellknown classical geometric regular polytopes and tessellations. In this context, the classical theory is concerned with those which are of globally or locally spherical type. In a ...
متن کاملPrologue: Regular polytopes
Current Version January 1, 2005 To motivate the study of finite reflection groups and Coxeter groups more generally, I’ll begin by briefly sketching the classification of regular polytopes. Convex polytopes are fundamental objects in mathematics which can be viewed in a number of equivalent ways: as the convex hull of a finite set of points in R, as the intersection of a finite number of half-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997