A recursive description of automorphism groups of inductively constructed polytopes

Publication date: 8 June 2022

Abstract: 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.

This page was built for publication: A recursive description of automorphism groups of inductively constructed polytopes

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