Capturing polytopal symmetries by coloring the edge-graph

DOI10.1007/S00454-023-00560-7arXiv2108.13483OpenAlexW3197861089MaRDI QIDQ6204769

Martin Winter

Publication date: 2 April 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: A general (convex) polytope $Psubsetmathbb R^d$ and its edge-graph $G_P$ 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 $mathrm{Aut}_{mathrm{GL}}(P)$, the group of linear symmetries of the polytope. We also construct an analogous coloring for $mathrm{Aut}_{mathrm{O}}(P)$, the group of orthogonal symmetries of $P$.

Full work available at URL: https://arxiv.org/abs/2108.13483

zbMATH Keywords

graph coloringconvex polytopesorthogonal symmetriesgraph symmetriesedge-graphlinear symmetries

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Polyhedra and polytopes; regular figures, division of spaces (51M20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Symmetry properties of polytopes (52B15)

Cites Work

• Unnamed Item
• Unnamed Item
• The Colin de Verdière number and graphs of polytopes
• On combinatorial and affine automorphisms of polytopes
• Drawing graphs by eigenvectors: theory and practice
• Affine symmetries of orbit polytopes
• Neighborly cubical polytopes
• Symmetries of 3-polytopes with fixed edge length
• Computing symmetry groups of polyhedra
• The edge-transitive polytopes that are not vertex-transitive

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