Capturing Polytopal Symmetries by Coloring the Edge-Graph

A (convex) polytope P subset of R-d and its edge-graph G(P) can have very distinct symmetry properties, in that the edge-graph can be much more symmetric than the polytope. In this article we ask whether this can be "rectified" by coloring the vertices and edges of GP, that is, whether we can find such a coloring so that the combinatorial symmetry group of the colored edge-graph is actually isomorphic (in a natural way) to the linear or orthogonal symmetry group of the polytope. As it turns out, such colorings exist and some of them can be constructed quite naturally. However, actually proving that they "capture polytopal symmetries" involves applying rather unexpected techniques from the intersection of convex geometry and spectral graph theory.