Let Pn (n ≥ 0) be an n-polytope, that is, a convex polytope in n-dimensional euclidean space
(Grünbaum [5], 3.1), and for 0 ≤ j ≤ n − 1 let
be its j-faces. If Pn itself and Ø (the empty set) are also allowed to be faces of Pn, of dimensions n and − 1 respectively, then the set of faces of Pn forms a lattice
partially ordered by inclusion ([5], 3.2). Two polytopes P1n and P2n are said to be combinatorially isomorphic, or of the same combinatorial type if their respective lattices of faces are isomorphic; that is, if there is a one–to–one correspondence between the set of faces of P1n and the set of faces of P2n which preserves the relation of inclusion ([5], 3.2). Similarly, any permutation of the set of faces of Pn which preserves inclusion will be called a (combinatorial) automorphism; it is clear that the set of automorphisms of Pn forms a group Γ(Pn), called the automorphism group of Pn.