Polytopes with preassigned automorphism groups
The main results of the paper under review read as follows: Theorem 1. Every finite group is the automorphism group of a finite abstract polytope. In particular, if \(\Gamma\) is isomorphic to a subgroup of the symmetric group \(S_{n+1}\), then there exists a finite abstract polytope \(\mathcal{P}\) of rank \(d\), \(d\leqslant n\), with automorphism group \(\Gamma\) such that \(\mathcal{P}\) is isomorphic to a face-to-face tessellation of the \((d-1)\)-sphere by topological copies of convex \((d-1)\)-polytopes. Theorem 2. The abstract polytope \(\mathcal{P}\) may be realized convexly.
combinatorical theory of convex polytopes
scientific article