A recursive description of automorphism groups of inductively constructed polytopes

2022/06/08 by Lara Beßmann, Beßmann, Lara
Computer Science · Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2206.03793

openalex publication_date 2022/06/08 · openalex created_date 2022/06/13 · openalex updated_date 2026/07/28

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.

Related

• On polytopes associated to factorisations of prime-powers
• Products of abstract polytopes
• Hereditary Polytopes
• Any Finite Group is the Group of Some Binary, Convex Polytope
• On Identifiable Polytope Characterization for Polytopic Matrix Factorization