The monodromy group
of an
-polytope
encodes the combinatorial information needed to construct
. By applying tools such as mixing, a natural group-theoretic operation, we develop various criteria for
itself to be the automorphism group of a regular
-polytope
. We examine what this can say about regular covers of
, study a peculiar example of a
-polytope with infinitely many distinct, minimal regular covers, and then conclude with a brief application of our methods to chiral polytopes.
1 December 1999 in Canadian Journal of Mathematics
We describe a simple way to manufacture faithful representations of the monodromy group of an n-polytope. This is used to determine the monodromy group for 𝓣n, the fully truncated n-simplex. As by-products, we get the minimal regular cover for 𝓣n, along with the analogous objects for a prism over a simplex.