A recursive description of automorphism groups of inductively constructed polytopes
Group Theory
2022-06-09 v1 Combinatorics
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.
Cite
@article{arxiv.2206.03793,
title = {A recursive description of automorphism groups of inductively constructed polytopes},
author = {Lara Beßmann},
journal= {arXiv preprint arXiv:2206.03793},
year = {2022}
}
Comments
10 pages, 1 figure