Computing symmetry groups of polyhedra
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- A Class of Cellulated Spheres with Non-Polytopal Symmetries
- A simple way to tell a simple polytope from its graph
- Algorithms for highly symmetric linear and integer programs
- Automatic Detection of Variable and Value Symmetries
- Classification of eight-dimensional perfect forms
- Classification of reflexive polyhedra in three dimensions
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity and algorithms for computing Voronoi cells of lattices
- Computing isometries of lattices
- Exploiting symmetries in polyhedral computations
- Finding a simple polytope from its graph in polynomial time
- Finite group theory.
- scientific article; zbMATH DE number 862502 (Why is no real title available?)
- Lectures on Polytopes
- Linear Preservers of Finite Reflection Groups
- On combinatorial and affine automorphisms of polytopes
- On the classification of reflexive polyhedra
- PALP: a package for analysing lattice polytopes with applications to toric geometry
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Puzzles and polytope isomorphisms
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- The E_t-construction for lattices, spheres and polytopes
- The isometries of the cut, metric and hypermetric cones
Cited in
(26)- The complete enumeration of 4-polytopes and 3-spheres with nine vertices
- Classification of affine symmetry groups of orbit polytopes
- A computational comparison of symmetry handling methods for mixed integer programs
- Multinomial combinatorial group representations of the octahedral and cubic symmetries
- Algorithms for highly symmetric linear and integer programs
- Automorphism groups and normal forms in Normaliz
- Generalized cut and metric polytopes of graphs and simplicial complexes
- Local orientation-preserving symmetry preserving operations on polyhedra
- The cone of quasi-semimetrics and exponent matrices of tiled orders
- Covering aspects of the Niemeier lattices
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
- Iso edge domains
- Enumeration of the facets of cut polytopes over some highly symmetric graphs
- Exploiting symmetries in polyhedral computations
- The Symmetry Group of the Permutahedron
- Polyhedral representation conversion up to symmetries
- Equivalence of lattice orbit polytopes
- scientific article; zbMATH DE number 1438954 (Why is no real title available?)
- Algebraic polytopes in Normaliz
- Identification of and symmetry computation for crystal nets
- C++ tools for exploiting polyhedral symmetries
- On the cohomology of linear groups over imaginary quadratic fields
- Computing characteristic polynomials of hyperplane arrangements with symmetries
- Moduli of polarised Enriques surfaces — Computational aspects
- Capturing polytopal symmetries by coloring the edge-graph
- Polytope symmetries of Feynman integrals
This page was built for publication: Computing symmetry groups of polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827288)
