Computing symmetry groups of polyhedra
  Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial structure of a polyhedron. In each case we give algorithmic methods to compute the corresponding group and discuss some practical experiences. For practical purposes the linear symmetry group is the most important, as its computation can be directly translated into a graph automorphism problem. We indicate how to compute integral subgroups of the linear symmetry group that are used for instance in integer linear programming. 
David Bremner, Mathieu Dutour Sikiric, Dmitrii V. Pasechnik, Thomas   Rehn, Achill Sch\"urmann
math.CO math.GR math.MG