Computing symmetry groups of polyhedra

DOI10.1112/S1461157014000400zbMath1351.52009arXiv1210.0206OpenAlexW2113016580WikidataQ56872308 ScholiaQ56872308MaRDI QIDQ2827288

Achill Schürmann, Thomas Rehn, Mathieu Dutour Sikirić, David Bremmer, Dimitrii V. Pasechnik

Publication date: 13 October 2016

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

polyhedronsymmetry groups

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Related Items (17)

Automorphism groups and normal forms in Normaliz ⋮ Algebraic Polytopes in Normaliz ⋮ Classification of affine symmetry groups of orbit polytopes ⋮ Equivalence of Lattice Orbit Polytopes ⋮ Generalized cut and metric polytopes of graphs and simplicial complexes ⋮ Iso edge domains ⋮ Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays ⋮ Computing characteristic polynomials of hyperplane arrangements with symmetries ⋮ Moduli of polarised Enriques surfaces — Computational aspects ⋮ Capturing polytopal symmetries by coloring the edge-graph ⋮ A computational comparison of symmetry handling methods for mixed integer programs ⋮ The cone of quasi-semimetrics and exponent matrices of tiled orders ⋮ On the cohomology of linear groups over imaginary quadratic fields ⋮ Covering aspects of the Niemeier lattices ⋮ Enumeration of the facets of cut polytopes over some highly symmetric graphs ⋮ The complete enumeration of 4-polytopes and 3-spheres with nine vertices ⋮ Exploiting Symmetries in Polyhedral Computations

Cites Work

• Unnamed Item
• Unnamed Item
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• PALP: a package for analysing lattice polytopes with applications to toric geometry
• On combinatorial and affine automorphisms of polytopes
• Finding a simple polytope from its graph in polynomial time
• Puzzles and polytope isomorphisms
• A simple way to tell a simple polytope from its graph
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Classification of reflexive polyhedra in three dimensions
• On the classification of reflexive polyhedra
• Computing isometries of lattices
• The \(E_t\)-construction for lattices, spheres and polytopes
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Algorithms for highly symmetric linear and integer programs
• The isometries of the cut, metric and hypermetric cones
• Exploiting Symmetries in Polyhedral Computations
• Complexity and algorithms for computing Voronoi cells of lattices
• A Class of Cellulated Spheres with Non-Polytopal Symmetries
• Classification of eight-dimensional perfect forms
• Automatic Detection of Variable and Value Symmetries
• Lectures on Polytopes
• Linear Preservers of Finite Reflection Groups

This page was built for publication: Computing symmetry groups of polyhedra