Algorithms for classifying regular polytopes with a fixed automorphism group

Dimitri Leemans, Mark Mixer

Abstract


In this paper, various algorithms used in the classifications of regular polytopes for given groups are compared. First computational times and memory usages are analyzed for the original algorithm used in one of these classifications. Second, a possible algorithm for isomorphism testing among polytopes is suggested. Then, two improved algorithms are compared, and finally, results are given for a new classification of all regular polytopes for certain alternating groups and for the sporadic group $Co_3$.

Full Text:

PDF


Contributions to Discrete Mathematics. ISSN: 1715-0868