Rubik's Abstract Polytopes
Giovanni Luca Marchetti
TL;DR
The paper develops a unified framework to generalize the Rubik's puzzle to arbitrary regular abstract polytopes by introducing the Rubik's construction ${\rm R}(\mathcal{P})$ and its group ${\rm GR}(\mathcal{P})$. It provides a wreath-product encoding that embeds ${\rm GR}(\mathcal{P})$ into a product of wreaths and proves that the image lies in the kernel of canonical characters, yielding coordinate-invariant constraints. The authors completely characterize the Rubik's group for the simplex ${\triangle^n}$, with explicit conditions on the component permutations and a detailed size formula, and extend the analysis to the hypercube ${\square^n}$, including a parity-coupled description and a corresponding size formula. They also develop extensions of facet moves to the whole polytope and relate non-rotational variants, hosotopes, and ditopes, culminating in a principled, dimension-agnostic model that parallels holonomy concepts in a discrete setting. The work unifies disparate Rubik-type groups and provides exact combinatorial and group-theoretic descriptions across dimensions, enabling algebraic and algorithmic insights into these discrete puzzles.
Abstract
We generalize the Rubik's cube, together with its group of configurations, to any abstract regular polytope. After discussing general aspects, we study the Rubik's simplex of arbitrary dimension and provide a complete description of the associated group. We sketch an analogous argument for the Rubik's hypercube as well.
