For every polytope $\mathcal{P}$ there is the universal regular polytope of the same rank as $\mathcal{P}$ corresponding to the Coxeter group $\mathcal{C} =[\infty, \dots, \infty]$. For a given automorphism $d$ of $\mathcal{C}$, using monodromy groups, we construct a combinatorial structure $\mathcal{P}^d$. When $\mathcal{P}^d$ is a polytope isomorphic to $\mathcal{P}$ we say that $\mathcal{P}$ is self-invariant with respect to $d$, or $d$-invariant. We develop algebraic tools for investigating these operations on polytopes, and in particular give a criterion on the existence of a $d$\nobreakdash-auto\-morphism of a given order. As an application, we analyze properties of self-dual edge-transitive polyhedra and polyhedra with two flag-orbits. We investigate properties of medials of such polyhedra. Furthermore, we give an example of a self-dual equivelar polyhedron which contains no polarity (duality of order 2). We also extend the concept of Petrie dual to higher dimensions, and we show how it can be dealt with using self-invariance.

Petrie polygons, especially as they arise in the study of regular polytopes and Coxeter groups, have been studied by geometers and group theorists since the early part of the twentieth century. An open question is the determination of which polyhedra possess Petrie polygons that are simple closed curves. The current work explores combinatorial structures in abstract polytopes, called Petrie schemes, that generalize the notion of a Petrie polygon. It is established that all of the regular convex polytopes and honeycombs in Euclidean spaces, as well as all of the Gr\"unbaum--Dress polyhedra, possess Petrie schemes that are not self-intersecting and thus have Petrie polygons that are simple closed curves. Partial results are obtained for several other classes of less symmetric polytopes.