Any finite group is the group of some binary, convex polytope

DOI10.1007/S00454-017-9945-0MaRDI QIDQ1704900zbMATH OpenOpenAlexFDO

Authors Jean-Paul Doignon

Publication date 13 March 2018

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

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

zbMATH Keywords

automorphismconvex polytopegraphgroup

Mathematics Subject Classification ID

Group actions on combinatorial structures (05E18) Symmetry properties of polytopes (52B15)

Abstract: For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the convex polytope we build for the given finite group is binary, and even combinatorial in the sense of Naddef and Pulleyblank (1981); the diameter of its skeleton is at most 2; any combinatorial automorphism of the polytope is induced by some isometry of the space; any automorphism of the skeleton is a combinatorial automorphism.

Recommendations

• A convex polytope and an antimatroid for any given, finite group
• Chaque groupe polycyclique-par-fini admet une structure polynomiale de degré borné
• Finiteness of the fundamental group of compact convex integral polyhedra
• Finite groups as prescribed polytopal symmetries
• scientific article; zbMATH DE number 4161004
• On Groups in Which Every Element has Finite Order
• The automorphism group of a compact generalized polygon has finite dimension
• A group-theoretical finiteness theorem
• scientific article; zbMATH DE number 724703
• Certain finite groups

Cites work

• Adjacency on combinatorial polyhedra
• All 0-1 polytopes are traveling salesman polytopes
• Extremal edge polytopes
• Grafos con grupo dado de automorfismos
• Hamiltonicity and combinatorial polyhedra
• scientific article; zbMATH DE number 3730177 (Why is no real title available?)
• scientific article; zbMATH DE number 3732083 (Why is no real title available?)
• scientific article; zbMATH DE number 3031989 (Why is no real title available?)
• On the automorphism groups of almost all Cayley graphs
• On the Minimum Order of Graphs with Given Group
• Polytopes with preassigned automorphism groups
• Symmetry groups of vertex-transitive polytopes
• The classification of minimal graphs with given abelian automorphism group

Cited in

(10)

• Finiteness of the fundamental group of compact convex integral polyhedra
• Classification of affine symmetry groups of orbit polytopes
• Prescribed Riemannian symmetries
• Finite groups as prescribed polytopal symmetries
• Combinatorially two-orbit convex polytopes
• Automorphisms of non-spherical buildings have unbounded displacement
• Prescribing symmetries and automorphisms for polytopes
• A convex polytope and an antimatroid for any given, finite group
• A characterization of affinely regular polygons
• Prescribed graphon symmetries and flavors of rigidity

This page was built for publication: Any finite group is the group of some binary, convex polytope

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