  Polytopes are ubiquitous in different areas of mathematics. Gleason and
Hubard established a factorisation theorem, stating that every abstract
polytope has a unique factorisation into prime polytopes. We compute the
automorphism group of a certain family of inductively constructed polytopes
using the unique factorisation.
