Capturing polytopal symmetries by coloring the edge-graph

From MaRDI portal
Publication:6204769




Abstract: A general (convex) polytope PsubsetmathbbRd and its edge-graph GP can have very distinct symmetry properties. We construct a coloring (of the vertices and edges) of the edge-graph so that the combinatorial symmetry group of the colored edge-graph is isomorphic (in a natural way) to mathrmAutmathrmGL(P), the group of linear symmetries of the polytope. We also construct an analogous coloring for mathrmAutmathrmO(P), the group of orthogonal symmetries of P.










This page was built for publication: Capturing polytopal symmetries by coloring the edge-graph

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